UCT-Treesplit- Parallel MCTS on Distributed Memory

Monte-Carlo Tree Search (MCTS) is a simulation-based search method that brought about great success to applica-tions such as Computer-Go in the past few years. The power of MCTS strongly depends on the number of simulations computed per time unit and the amount of memory avail-able to store data gathered during simulation. In this paper, we present a novel approach for the parallelization of MCTS which allows for an equally distributed spreading of both the work and memory load among all compute nodes within a distributed memory HPC system