Parallel Nested Monte-Carlo search
Tristan Cazenave, Nicolas Jouandeau · 2009
We address the parallelization of a Monte-Carlo 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.