Design and Implementation of Chinese Dark Chess Programs

作者：Yen Shi Jim^*; Chou Cheng Wei; Chen Jr Chang; Wu I Chen; Kao Kuo Yuan

来源：IEEE Transactions on Computational Intelligence and AI in Games, 2015, 7(1): 66-74.

DOI：10.1109/TCIAIG.2014.2329034

• Chance nodes
• Chinese Dark Chess
• Monte Carlo Tree Search
• nondeterministic actions
• stochastic games

Chinese Dark Chess is an old and very popular game in the Chinese culture sphere. This game is a stochastic game with symmetric hidden information. This paper reviews alpha-beta search with chance nodes and proposes heuristics on Chinese Dark Chess programs. We propose an application of nondeterministic Monte Carlo Tree Search with random nodes for tackling partial observation. The proposed methods were implemented in the program Diablo, which won four Chinese Dark Chess tournaments in TAAI 2011/2012, TCGA 2011/2012 computer game tournaments. Diablo also played hundreds of games with different human players and programs based on alpha-beta search. These results show that the nondeterministic MCTS equipped with our heuristics is promising for Chinese Dark Chess.

• 出版日期2015-3
• 单位东华大学