Authors:
S. Gelly
1
;
J. B. Hoock
1
;
A. Rimmel
1
;
O. Teytaud
1
and
Y. Kalemkarian
2
Affiliations:
1
TAO (Inria), Lri, UMR Cnrs 8623, Univ. Paris-Sud, France
;
2
High Performance Calculus, France
Keyword(s):
Bandit-based Monte-Carlo planning, parallelization, multi-core machines, message-passing.
Related
Ontology
Subjects/Areas/Topics:
Artificial Intelligence
;
Decision Support Systems
;
Formal Methods
;
Informatics in Control, Automation and Robotics
;
Intelligent Control Systems and Optimization
;
Planning and Scheduling
;
Simulation and Modeling
;
Symbolic Systems
Abstract:
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.