Tree Parallelization of Ary on a Cluster
Jean Méhat, Tristan Cazenave · 2011
We investigate the benefits of Tree Parallelization on a clus-ter for our General Game Playing program Ary. As the Tree parallelization of Monte-Carlo Tree Search works well when playouts are slow, it is of interest for General Game Play-ing programs, as the interpretation of game description takes a large proportion of the computing time, when compared with program designed to play specific games. We show that the tree parallelization does provide an advantage, but that it decreases for common games as the number of subplayers grows beyond 10.