{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T03:44:50Z","timestamp":1777693490512,"version":"3.51.4"},"reference-count":19,"publisher":"SAGE Publications","issue":"4","license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["ICGA Journal: The Journal of the Computer Games Community"],"published-print":{"date-parts":[[2018,1]]},"abstract":"<jats:p>In this paper, we present the techniques, such as bitboard, iterative-deepening aspiration search algorithm, endgame tablebase, used in our Surakarta program Fuchou. A bijective function similar to Schadd\u2019s is developed to map a Surakarta board position to a unique address of the endgame tablebase. The function is one-to-one and onto and can be computed very quickly using some techniques compared to conventional methods. We have implemented it on our Surakarta program FuChou. Experimental results show that we have gotten advantages of speedup as well as accuracy on the endgame boards.<\/jats:p>","DOI":"10.3233\/icg-180071","type":"journal-article","created":{"date-parts":[[2018,11,23]],"date-time":"2018-11-23T10:47:25Z","timestamp":1542970045000},"page":"438-449","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":2,"title":["Design and implementation aspects of a Surakarta program"],"prefix":"10.1177","volume":"40","author":[{"given":"Yen-Chi","family":"Chen","sequence":"first","affiliation":[{"name":"National Taiwan Normal University","place":["Taiwan"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jia-Fong","family":"Yeh","sequence":"additional","affiliation":[{"name":"National Taiwan Normal University","place":["Taiwan"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shun-Shii","family":"Lin","sequence":"additional","affiliation":[{"name":"National Taiwan Normal University","place":["Taiwan"]}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2018,11,23]]},"reference":[{"key":"e_1_3_2_2_1","doi-asserted-by":"publisher","DOI":"10.1070\/RM1970v025n02ABEH003792"},{"key":"e_1_3_2_3_1","unstructured":"Allis L.V. van den Herik H.J. & Huntijens M.P.H. (1994a). Go-Moku and Threat-Space Search. Interview Questions."},{"key":"e_1_3_2_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(94)90004-3"},{"key":"e_1_3_2_5_1","doi-asserted-by":"publisher","DOI":"10.3233\/ICG-2014-37103"},{"key":"e_1_3_2_6_1","doi-asserted-by":"publisher","unstructured":"Chen J.C. Fan G.Y. Chang H.J. & Hsu T.S. (2018). Compressing Chinese dark chess endgame databases by deep learning. IEEE Transactions on Games. doi:10.1109\/TG.2018.2802484.","DOI":"10.1109\/TG.2018.2802484"},{"key":"e_1_3_2_7_1","doi-asserted-by":"crossref","unstructured":"Coulom R. (2006). Efficient selectivity and backup operators in Monte-Carlo tree search. In 5thInternational Conference on Computers and Games (pp. 72\u201383).","DOI":"10.1007\/978-3-540-75538-8_7"},{"key":"e_1_3_2_8_1","unstructured":"Endgame Tablebases chessprogramming URL: https:\/\/chessprogramming.wikispaces.com\/Endgame+Tablebases."},{"key":"e_1_3_2_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/34.106996"},{"key":"e_1_3_2_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(75)90019-3"},{"key":"e_1_3_2_11_1","doi-asserted-by":"crossref","unstructured":"Kocsis L. & Szepesv\u00e1ri C. (2006). Bandit based Monte-Carlo planning. In 15thEuropean Conference on Machine Learning (pp. 282\u2013293).","DOI":"10.1007\/11871842_29"},{"key":"e_1_3_2_12_1","unstructured":"Marsland T. & Campbell M. (1982). A Study of Parallel Tree Search Algorithms. Technical Report TR 82-4 Computing Science Department University of Alberta."},{"key":"e_1_3_2_13_1","unstructured":"Nalimov E. (1998). Nalimov\u2019s TBs: One question by Eugene Nalimov Computer Chess Club November 18 1998. URL: https:\/\/www.stmintz.com\/ccc\/index.php?id=33351."},{"key":"e_1_3_2_14_1","unstructured":"Schadd M.P.D. (2011). Selective Search in Games of Different Complexity. Ph.D. Thesis Department of Knowledge Engineering Maastricht University Maastricht The Netherlands."},{"key":"e_1_3_2_15_1","doi-asserted-by":"publisher","DOI":"10.1038\/nature16961"},{"key":"e_1_3_2_16_1","unstructured":"Str\u00f6hlein T. (1970). Untersuchungen \u00fcber kombinatorische Spiele. Ph.D. Thesis Technical University of Munich German."},{"issue":"1","key":"e_1_3_2_17_1","first-page":"22","article-title":"Chess endgames","volume":"14","author":"Thompson K.","year":"1991","unstructured":"Thompson, K. (1991). Chess endgames. ICCA Journal, 14(1), 22.","journal-title":"ICCA Journal"},{"issue":"4","key":"e_1_3_2_18_1","first-page":"215","article-title":"6-piece endgames","volume":"19","author":"Thompson K.","year":"1996","unstructured":"Thompson, K. (1996). 6-piece endgames. ICCA Journal, 19(4), 215\u2013226.","journal-title":"ICCA Journal"},{"key":"e_1_3_2_19_1","unstructured":"Winands M.H.M. (2016). The Surakarta bot revealed. In T.Cazenave M.Winands S.Edelkamp S.\u00a0Schiffel M.Thielscher and J.Togelius (Eds.) Computer Games. CGW 2015 GIGA 2015. Communications in Computer and Information Science (Vol.\u00a0614). Cham: Springer."},{"key":"e_1_3_2_20_1","doi-asserted-by":"crossref","unstructured":"Zhang L. & Ding L. (2011). A storage structure and capture judging algorithm of realizing the computer game program of Surakarta chess. In Proc. 23thChinese Control and Decision Conference Mianyang (pp. 3442\u20133445).","DOI":"10.1109\/CCDC.2011.5968711"}],"container-title":["ICGA Journal: The Journal of the Computer Games Community"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/ICG-180071","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.3233\/ICG-180071","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/ICG-180071","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T09:12:54Z","timestamp":1777453974000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/ICG-180071"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1]]},"references-count":19,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,1]]}},"alternative-id":["10.3233\/ICG-180071"],"URL":"https:\/\/doi.org\/10.3233\/icg-180071","relation":{},"ISSN":["1389-6911","2468-2438"],"issn-type":[{"value":"1389-6911","type":"print"},{"value":"2468-2438","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,1]]}}}