Since their impressive successes in various areas of large-scale parallelization,
recent techniques like UCT and other Monte-Carlo planning variants (Kocsis and
Szepesvari, 2006a) have been extensively studied (Coquelin and Munos, 2007; Wang
and Gelly, 2007). We here propose and compare various forms of parallelization of
bandit-based tree-search, in particular for our computer-go algorithm XYZ.