Information Set Monte Carlo Tree Search
Cowling, Peter I.
Powley, Edward J.
1712 | 2207 | 1702 | 2208
arxiv: Computer Science::Computer Science and Game Theory
Monte Carlo tree search (MCTS) is an AI technique that has been successfully applied to many deterministic games of perfect information. This paper investigates the application of MCTS methods to games with hidden information and uncertainty. In particular, three new information set MCTS (ISMCTS) algorithms are presented which handle different sources of hidden information and uncertainty in games. Instead of searching minimax trees of game states, the ISMCTS algorithms search trees of information sets, more directly analyzing the true structure of the game. These algorithms are tested in three domains with different characteristics, and it is demonstrated that our new algorithms outperform existing approaches to handling hidden information and uncertainty in games. Index Terms—Artificial intelligence (AI), game tree search, hidden information, Monte Carlo methods, Monte Carlo tree search (MCTS), uncertainty.
41 references, page 1 of 5
views in local repository
downloads in local repository
The information is available from the following content providers: