Chinese chess is an artificial intelligence (AI) domain that merges ancient culture with emerging technology. This article explores key aspects of current Chinese chess technology, including move generation, evaluation functions, and search techniques in the search engine, as well as developments in the opening knowledge base and endgame databases. We also examine parallelization techniques, which are essential for improving computational efficiency and performance. Inspired by AlphaZero's achievements in reinforcement learning, this article also explores its key concepts and impact on AI techniques. It further highlights the field's development and the notable performance of computer Chinese chess in international competitions, particularly in human versus computer matches and global tournaments. The article concludes with a discussion of future trends in computer Chinese chess technology.
AcherM.EsnaultF. (2016). Large-scale analysis of chess games with chess engines: A preliminary report. arXiv preprint arXiv:1607.04186.
2.
AmdahlG. M. (1967). Validity of the single processor approach to achieving large scale computing capabilities. Spring Joint Computer Conference, 483–485. https://doi.org/10.1145/1465482.1465560
BrowneC. B.PowleyE.WhitehouseD.LucasS. M.CowlingP. I.RohlfshagenP.TavenerS.PerezD.SamothrakisS.ColtonS. (2012). A survey of Monte Carlo tree search methods. IEEE Transactions on Computational Intelligence and AI in Games, 4(1), 1–43. https://doi.org/10.1109/TCIAIG.2012.2186810
5.
ChenZ.-X. (1994). A study on Tyng-Jaur-Sha: Checkmate strategy for computer Chinese chess [M.Sc. thesis, Department of Electrical Engineering and Computer Engineering and Science, Yuan Ze University], Taiwan. [in Chinese].
6.
ChenB.-H. (1996). Building an integrated environment for Chinese chess based on client/server architecture – The design and implementation of the client program [M.Sc. thesis, Department of Computer Science and Information Engineering, National Taiwan University], Taiwan. [in Chinese].
7.
ChenJ.-C. (2005). Design and implementation of knowledge-base system for computer Chinese chess [Ph.D. thesis, Department of Computer Science and Information Engineering, National Taiwan University], Taiwan. [in Chinese].
8.
ChenH.-H. (2006). Machine learning of computer Chinese chess, [M.Sc. thesis, Department of Computer Science and Information Engineering, National Yunlin University of Science and Technology], Taiwan. [in Chinese].
9.
ChenB.-N.ChenJ.-Y.ChenJ.-C.HsuT.-S.LiuP.-FHsuS.-C. (2009a). An intelligent tutoring system of Chinese chess. Next-Generation Applied Intelligence: 22nd International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems (IEA/AIE 2009), 350–359. Springer Berlin Heidelberg.
ChenB.-N.LiuP.-F.HsuS.-C.HsuT.-S. (2011). Knowledge abstraction in Chinese chess endgame databases. Computers and Games: 7th International Conference (CG 2010), 176–187. Springer Berlin Heidelberg.
12.
ChenB.-N.LiuP.-F.HsuS.-C.HsuT.-S. (2012). Aggregating consistent endgame knowledge in Chinese chess. Knowledge-Based Systems, 34, 34–42. https://doi.org/10.1016/j.knosys.2011.11.020
13.
ChenJ.-C.TsengW.-J.WuI.-C.WeiT.-H. (2018). Comparison training for computer Chinese chess. IEEE Transactions on Games, 12(2), 169–176. https://doi.org/10.1109/TG.2019.2893430
14.
ChenJ.-C.WuI.-C.TsengW.-J.LinB.-H.ChangC.-H. (2015). Job-level alpha-beta search. IEEE Transactions on Computational Intelligence and AI in Games, 7(1), 28–38. https://doi.org/10.1109/TCIAIG.2014.2316314
15.
ChengM.-C. (2006). The chess location evaluation tables of Chinese chess program [M.Sc. thesis, Department of Engineering Science, National Cheng Kung University], Taiwan. (in Chinese).
FangH.-R.HsuT.-S.HsuS.-C. (2001). Construction of Chinese chess endgame databases by retrograde analysis. Computers and Games: Second International Conference (CG 2000), 96–114. Springer Berlin Heidelberg.
26.
HeW.ZhaoW.JiangY. (2019). Application of Q-learning and RBF network in Chinese chess game system. IOP Conference Series: Materials Science and Engineering, 677(2), Article ID 022101. https://doi.org/10.1088/1757-899X/677/2/022101.
HengS. (2022). Tree search algorithms for Chinese chess. Highlights in Science, Engineering and Technology, 12, 13–24. https://doi.org/10.54097/hset.v12i.1358
30.
HokiK.MuramatsuM. (2012). Efficiency of three forward-pruning techniques in shogi: Futility pruning, null-move pruning, and late move reduction (LMR). Entertainment Computing, 3(3), 51–57. https://doi.org/10.1016/j.entcom.2011.11.003
31.
HsuS.-C.HuangD.-H. (1985). Design and implementation of a Chinese chess knowledge base. National Computer Symposium (NCS 1985), 505–509. [in Chinese].
32.
HuangW.-C. (2006). The design and implementation for the middle game of computer Chinese deep elephant [M.Sc. thesis, Department of Computer Science and Information Engineering, National Taiwan Normal University], Taiwan. [in Chinese].
33.
HyattR. M.MannT. (2002). A lockless transposition-table implementation for parallel search. ICGA Journal, 25(1), 36–39. https://doi.org/10.3233/ICG-2002-25104
34.
KaoW.-L. (2009). The automatically tuning system of evaluation function for computer Chinese chess [M.Sc. thesis, Department of Computer Science, National Chiao Tung University], Taiwan. (in Chinese).
35.
KishimotoA.MüllerM. (2004). A general solution to the graph history interaction problem. 19th National Conference on Artificial Intelligence (AAAI 2004), 644–649.
LeeT.-R. (1996). Building an integrated environment for Chinese chess based on client/server architecture – The design and implementation of the server [M.Sc. thesis, Department of Computer Science and Information Engineering, National Taiwan University], Taiwan. [in Chinese].
39.
LiM.HuangW. (2020). Research and implementation of Chinese chess game algorithm based on reinforcement learning. 5th International Conference on Control, Robotics and Cybernetics (CRC 2020), 81–86.
40.
LiaoJ.-C. (1982). An experiment on computer Chinese chess [M.Sc. thesis, Department of Computer Science, National Chiao Tung University], Taiwan. [in Chinese].
41.
LinckeT. R. (2001). Strategies for the automatic construction of opening books. Computers and Games: Second International Conference (CG 2000), 74–86. Springer Berlin Heidelberg.
42.
LiuJ.-H.LinJ.-S.HsuS.-C. (1995). A study of checkmate search strategies in computer Chinese chess. Journal of Computers, 7(3-4), 1–9. [in Chinese].
43.
LiuM.-C. (2013). The design and implementation of the Chinese chess program Shark [M.Sc. thesis, Department of Computer Science and Information Engineering, National Taiwan Normal University], Taiwan. [in Chinese].
44.
ManohararajahV. (2001). Parallel alpha-beta search on shared memory multiprocessors [M.Sc. thesis, University of Toronto].
45.
MarslandT. A.CampbellM. (1982). Parallel search of strongly ordered game trees. ACM Computing Surveys (CSUR), 14(4), 533–551. https://doi.org/10.1145/356893.356895
46.
MatsuzakiK. (2018). Empirical analysis of PUCT algorithm with evaluation functions of different quality. 2018 Conference on Technologies and Applications of Artificial Intelligence (TAAI), 142–147.
47.
McIlroy-YoungR.SenS.KleinbergJ.AndersonA. (2020). Aligning superhuman AI with human behavior: Chess as a model system. 26th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 1677–1687.
48.
MinJ. K. (2018). Chess and coronary artery ischemia: Clinical implications of machine-learning applications. Circulation: Cardiovascular Imaging, 11(6), e007943. https://doi.org/10.1161/CIRCIMAGING.118.007943
49.
NalimovE. V.HaworthG.HeinzE. A. (2000). Space-efficient indexing of chess endgame tables. ICGA Journal, 23(3), 148–162. https://doi.org/10.3233/ICG-2000-23304
PlaatA.SchaefferJ.PijlsW.de BruinA. (1995). An algorithm faster than NegaScout and SSS* in practice. Computer Strategy Game Programming Workshop, 1–16.
ScheiermannJ.KonenW. (2022). AlphaZero-inspired game learning: Faster training by using MCTS only at test time. IEEE Transactions on Games, 15(4), 637–647. https://doi.org/10.1109/TG.2022.3206733
58.
SchrittwieserJ.AntonoglouI.HubertT.SimonyanK.SifreL.SchmittS.GuezA.LockhartE.HassabisD.GraepelT.LillicrapT.SilverD. (2020). Mastering atari, go, chess and shogi by planning with a learned model. Nature, 588(7839), 604–609. https://doi.org/10.1038/s41586-020-03051-4
59.
SchutL.TomasevN.McGrathT.HassabisD.PaquetU.KimB. (2023). Bridging the human-AI knowledge gap: Concept discovery and transfer in AlphaZero. arXiv preprint arXiv:2310.16410.
60.
ShahN. R. (2019). Health care in 2030: Will artificial intelligence replace physicians?Annals of Internal Medicine, 170(6), 407–408. https://doi.org/10.7326/M19-0344
SilverD.HuangA.MaddisonC. J.GuezA.SifreL.Van Den DriesscheG.SchrittwieserJ.AntonoglouI.PanneershelvamV.LanctotM.DielemanS.GreweD.NhamJ.KalchbrennerN.SutskeverI.LillicrapT.LeachM.KavukcuogluK.GraepelT.HassabisD. (2016). Mastering the game of go with deep neural networks and tree search. Nature, 529(7587), 484–489. https://doi.org/10.1038/nature16961
63.
SilverD.SchrittwieserJ.SimonyanK.AntonoglouI.HuangA.GuezA.HubertT.BakerL.LaiM.BoltonA.ChenY.LillicrapT.HuiF.SifreL.Van Den DriesscheG.GraepelT.HassabisD. (2017). Mastering the game of go without human knowledge. Nature, 550(7676), 354–359. https://doi.org/10.1038/nature24270
64.
SinclairD. (1998). Using example-based reasoning for selective move generation in two player adversarial games. Advances in Case-Based Reasoning: 4th European workshop (EWCBR-98), 126–135. Springer Berlin Heidelberg.
65.
TaoJ.WuG.PanX. (2020). Design and improvement of the pruning algorithm of the Chinese chess in the computer games. The Journal of Engineering, 2020(429), 426–428. https://doi.org/10.1049/joe.2019.1169
TsaiH.-C. (2005). The N-relaxed checking-win search problem in Chinese chess [M.Sc. thesis, Department of Computer Science and Information Engineering, National Taiwan University], Taiwan. [in Chinese].
68.
TsaoK.-M. (1988). Design and implementation of an intelligent Chinese chess program [M.Sc. thesis, Department of Computer Science and Information Engineering, National Taiwan University], Taiwan. [in Chinese].
69.
TungY.-T. (2003). Design and implement of Chinese chess program DAI [M.Sc. thesis, Department of Computer Science and Information Engineering, National Dong Hwa University], Taiwan. [in Chinese].
WuK.-C. (2005). Graph history interaction problem in computer Chinese chess [M.Sc. thesis, Department of Computer Science and Information Engineering, National Taiwan University], Taiwan. [in Chinese].
72.
WuP.-H.LiuP.-Y.HsuT.-S. (2006). An external-memory retrograde analysis algorithm. Computers and Games: 4th International Conference (CG 2004), 145–160. Springer Berlin Heidelberg.
XuC.DingH.ZhangX.WangC.YangH. (2022). A data-efficient method of deep reinforcement learning for Chinese chess. IEEE 22nd International Conference on Software Quality, Reliability, and Security Companion (QRS-C 2022), 1–8.
ZhangY.-T. (1981). Artificial intelligence in Chinese chess [M.Sc. thesis, Department of Electrical Engineering, National Taiwan University], Taiwan. [in Chinese].
ZhuangY.-T.WuF.ChenC.PanY.-H. (2017). Challenges and opportunities: From big data to knowledge in AI 2.0. Frontiers of Information Technology and Electronic Engineering, 18, 3–14. https://doi.org/10.1631/FITEE.1601883
82.
ZobristA. L. (1970). A new hashing method with applications for game playing. Technical Report (88).
