Sciweavers

146 search results - page 1 / 30
» Parallel Monte-Carlo Tree Search
Sort
View
CG
2008
Springer
13 years 6 months ago
Parallel Monte-Carlo Tree Search
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...
Guillaume Chaslot, Mark H. M. Winands, H. Jaap van...
CG
2010
Springer
13 years 2 months ago
Scalability and Parallelization of Monte-Carlo Tree Search
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...
Amine Bourki, Guillaume Chaslot, Matthieu Coulm, V...
CG
2008
Springer
13 years 6 months ago
A Parallel Monte-Carlo Tree Search Algorithm
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...
Tristan Cazenave, Nicolas Jouandeau
ACG
2009
Springer
13 years 11 months ago
A Lock-Free Multithreaded Monte-Carlo Tree Search Algorithm
With the recent success of Monte-Carlo tree search algorithms in Go and other games, and the increasing number of cores in standard CPUs, the efficient parallelization of the sear...
Markus Enzenberger, Martin Müller 0003
KI
2011
Springer
12 years 11 months ago
Centurio, a General Game Player: Parallel, Java- and ASP-based
Abstract We present the General Game Playing system Centurio. Centurio is a Java-based player featuring different strategies based on Monte Carlo Tree Search extended by technique...
Maximilian Möller, Marius Thomas Schneider, M...