Parallel Nested Monte-Carlo search

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 algorithm that behaves better than a naive one on heterogeneous clusters is also detailed.

• Type: Conference
• Year: 2009
• Where: IPPS
• Authors: Tristan Cazenave, Nicolas Jouandeau
• Keywords: Distributed And Parallel Computing, Heterogeneous Clusters, IPPS 2009, MonteCarlo Search Algorithm, Parallelization