Parallelization of Monte Carlo Tree Search in Continuous Domains

Karl Kurzer, Christoph Hörtnagl, J. Marius Zöllner

Monte Carlo Tree Search (MCTS) has proven to be capable of solving challenging tasks in domains such as Go, chess and Atari. Previous research has developed parallel versions of MC…