Scalability and Parallelization of Monte-Carlo Tree Search - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2010

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 parallelization, in particular for our program MoGo but also for our Havannah program Shakti. In particular, we get a good efficiency for the parallel versions, both for multicore machines and for message-passing machines, but in spite of promising results in self-play there are situations for which increasing the time per move does not solve anything, and therefore parallelization is not the solution either. Nonetheless, for problems on which the Monte-Carlo part is less biased than in Go, parallelization should be very efficient even without shared memory.
Fichier principal
Vignette du fichier
newcluster.pdf (295.71 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00512854 , version 1 (31-08-2010)


  • HAL Id : inria-00512854 , version 1


Amine Bourki, Guillaume Chaslot, Matthieu Coulm, Vincent Danjean, Hassen Doghmen, et al.. Scalability and Parallelization of Monte-Carlo Tree Search. The International Conference on Computers and Games 2010, Sep 2010, Kanazawa, Japan. ⟨inria-00512854⟩
680 View
1351 Download


Gmail Facebook Twitter LinkedIn More