44 search results - page 3 / 9 » Single-Player Monte-Carlo Tree Search |
AIIDE
2008
13 years 9 months ago
2008
Classic approaches to game AI require either a high quality of domain knowledge, or a long time to generate effective AI behaviour. These two characteristics hamper the goal of es...
CG
2008
Springer
13 years 9 months ago
2008
Springer
Monte-Carlo tree search is a powerful paradigm for the game of Go. We present a parallel Master-Slave algorithm for Monte-Carlo tree search. We experimented the algorithm on a netw...
CG
2010
Springer
13 years 5 months ago
2010
Springer
Monte-Carlo Tree Search (MCTS) is a successful algorithm used in many state of the art game engines. We propose to improve a MCTS solver when a game has more than two outcomes. It ...
CG
2008
Springer
13 years 9 months ago
2008
Springer
Recently, Monte-Carlo Tree Search (MCTS) has advanced the field of computer Go substantially. In this article we investigate the application of MCTS for the game Lines of Action (L...
CG
2010
Springer
13 years 5 months ago
2010
Springer
Monte-Carlo Tree Search is now a well established algorithm, in games and beyond. We analyze its scalability, and in particular its limitations, and the implications in terms of pa...