Affiliation:
1. Department of CSIE, National Taiwan Normal University, Taipei, Taiwan, ROC
Abstract
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’s 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.
Subject
Computer Graphics and Computer-Aided Design,Human-Computer Interaction,Computational Mechanics,Computer Science (miscellaneous)
Reference13 articles.
1. Programming a computer to play chess;Adelson-Velsky;Russian Mathematical Surveys,1970
2. Proof-number search;Allis;Artificial Intelligence,1994
3. Advanced meta-knowledge for Chinese chess endgame knowledge bases;Chen;ICGA Journal,2014
4. Compressing Chinese Dark Chess Endgame Databases by Deep Learning
5. Coulom, R. (2006). Efficient selectivity and backup operators in Monte-Carlo tree search. In 5th International Conference on Computers and Games (pp. 72–83).
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献