Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1109/TCIAIG.2014.2329034 | IEEE Trans. Comput. Intellig. and AI in Games |
Keywords | Field | DocType |
chinese dark chess,chance nodes,stochastic game,alpha-beta search,random processes,tree searching,nondeterministic actions,computer game tournament,monte carlo methods,nondeterministic mcts,chinese culture sphere,random nodes,program diablo,monte carlo tree search,nondeterministic monte carlo tree search,chinese dark chess program,symmetric hidden information,stochastic games,computer games,backpropagation,alpha beta search,color,probability distribution,games | Quiescence search,Monte Carlo method,Monte Carlo tree search,Nondeterministic algorithm,Computer science,Transposition table,Probability distribution,Heuristics,Artificial intelligence,Stochastic game | Journal |
Volume | Issue | ISSN |
7 | 1 | 1943-068X |
Citations | PageRank | References |
6 | 0.48 | 9 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Shi-jim Yen | 1 | 134 | 27.99 |
| Cheng-Wei Chou | 2 | 6 | 1.16 |
| Jr-Chang Chen | 3 | 42 | 15.19 |
| I-Chen Wu | 4 | 208 | 55.03 |
| Kuo-Yuan Kao | 5 | 23 | 5.33 |