Sciweavers

Share
CG
2008
Springer

A Parallel Monte-Carlo Tree Search Algorithm

8 years 4 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 network of computers using various configurations: from 12,500 to 100,000 playouts, from 1 to 64 slaves, and from 1 to 16 computers. On our architecture we obtain a speedup of 14 for 16 slaves. With a single slave and five seconds per move our algorithm scores 40.5% against GNUGO, with sixteen slaves and five seconds per move it scores 70.5%. We also give the potential speedups of our algorithm for various playout times.
Tristan Cazenave, Nicolas Jouandeau
Added 12 Oct 2010
Updated 12 Oct 2010
Type Conference
Year 2008
Where CG
Authors Tristan Cazenave, Nicolas Jouandeau
Comments (0)
books