Thumbnail - Request a copy

Tree Parallelization of Ary on a Cluster

Méhat, Jean; Cazenave, Tristan (2011), Tree Parallelization of Ary on a Cluster, GIGA 2011 -- IJCAI 2011, 2011-07, Barelone, Espagne

Type
Communication / Conférence
Date
2011
Conference title
GIGA 2011 -- IJCAI 2011
Conference date
2011-07
Conference city
Barelone
Conference country
Espagne
Pages
39-44
Metadata
Show full item record
Author(s)
Méhat, Jean
Cazenave, Tristan
Abstract (EN)
We investigate the benefits of Tree Parallelization on a cluster 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 Playing 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.
Subjects / Keywords
General Game Playing; Ary, General Game Playing; Parallel processing (Electronic computers); Monte Carlo method