Parallel Monte-Carlo Tree Search

Monte-Carlo Tree Search (MCTS) is a new best-first search method that started a revolution in the field of Computer Go. Parallelizing MCTS is an important way to increase the strength of any Go program. In this article, we discuss three parallelization methods for MCTS: leaf parallelization, root parallelization, and tree parallelization. To be effective tree parallelization requires two techniques: adequately handling of (1) local mutexes and (2) virtual loss. Experiments in 13

• Type: Conference
• Year: 2008
• Where: CG
• Authors: Guillaume Chaslot, Mark H. M. Winands, H. Jaap van den Herik
• Keywords: CG 2008, Computer Graphics, Effective Tree Parallelization, Root Parallelization, Tree Parallelization