Parallel Nested Monte-Carlo search

Published: 2009, Last Modified: 30 Sept 2024IPDPS 2009EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: 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.
Loading