Evaluating Root Parallelization in Go

Abstract--Parallelizing Monte-Carlo tree search has been considered to be a way to improve the strength of computer Go programs. In this paper, we analyze the performance of two root parallelization methods

• Type: Journal
• Year: 2010
• Where: TCIAIG
• Authors: Yusuke Soejima, Akihiro Kishimoto, Osamu Watanabe
• Keywords: Average Selection, Majority Voting, Root Parallelization Methods, Software Engineering, TCIAIG 2010