Name
Abstract | ||
|---|---|---|
Playing games with imperfect information is a very challenging issue in AI field due to its high complexity. Phantom game is a kind of such games, which usually has a large game-tree complexity and has little research achievements until now. In Phantom games, rational human players commonly select actions according to their beliefs in the game, which can be represented as a concept of belie f-state. To the best of our knowledge, our paper is the first article to incorporate belief-states in the Monte-Carlo Tree Search, and the proposed algorithm is named BS-MCTS (Belief-state Monte-Carlo Tree Search). In BS-MCTS, a belief-state tree, in which each node is a belief-state, is constructed and the search procedure is in accordance with beliefs updated by heuristic search information. We also present two novel implementations in the belief learning, that are Opponent Guessing and Opponent Predicting, concerning the probability on the possible states and on future actions of the opponent respectively. To prove the effectiveness of our algorithm, BS-MCTS is applied to Phantom Tic-Tac-Toe and Phantom Go against other Monte-Carlo methods. The experimental results demonstrate that our method is outstanding and advanced. Moreover, based on BS-MCTS, our Phantom Go program had consecutively won three championships in Chinese National Tournaments. |
Year | Venue | Field |
|---|---|---|
2015 | IEEE Conference on Computational Intelligence and Games | Heuristic,Monte Carlo tree search,Computer science,Simulation,Search procedure,Imaging phantom,Implementation,Artificial intelligence,Perfect information,Machine learning |
DocType | ISSN | Citations |
Conference | 2325-4270 | 0 |
PageRank | References | Authors |
0.34 | 16 | 5 |