88 search results - page 2 / 18 » A Parallel Monte-Carlo Tree Search Algorithm |
CG
2008
Springer
13 years 6 months ago
2008
Springer
Monte-Carlo Tree Search (MCTS) is a new best-first search method that started a revolution in the field of Computer Go. Parallelizing MCTS is an important way to increase the stren...
IPPS
2009
IEEE
13 years 11 months ago
2009
IEEE
Abstract—We address the parallelization of a MonteCarlo search algorithm. On a cluster of 64 cores we obtain a speedup of 56 for the parallelization of Morpion Solitaire. An algo...
CG
2010
Springer
13 years 2 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
2006
Springer
13 years 8 months ago
2006
Springer
Monte-Carlo evaluation consists in estimating a position by averaging the outcome of several random continuations, and can serve as an evaluation function at the leaves of a min-ma...
CG
2010
Springer
13 years 2 months ago
2010
Springer
Abstract. The Monte-Carlo Tree Search algorithm has been successfully applied in various domains. However, its performance heavily depends on the Monte-Carlo part. In this paper, w...