The grand challenge of computer Go: Monte Carlo Tree Search and Extensions

Gelly, Sylvain and Kocsis, Levente and Schoenauer, Marc and Sebag, Michèle and Silver, David and Szepesvári, Csaba and Teytaud, Olivier (2012) The grand challenge of computer Go: Monte Carlo Tree Search and Extensions. Communications of the ACM, 55 (3). p. 106. ISSN 00010782 10.1145/2093548.2093574

Full text not available from this repository.


The ancient oriental game of Go has long been considered a grand challenge for artificial intelligence. For decades, computer Go has defied the classical methods in game tree search that worked so successfully for chess and checkers. However, recent play in computer Go has been transformed by a new paradigm for tree search based on Monte-Carlo methods. Programs based on Monte-Carlo tree search now play at human-master levels and are beginning to challenge top professional players. In this paper, we describe the leading algorithms for Monte-Carlo tree search and explain how they have advanced the state of the art in computer Go.

Item Type: ISI Article
Subjects: Q Science > QA Mathematics and Computer Science > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány
Divisions: Informatics Laboratory
Depositing User: Levente Kocsis
Date Deposited: 23 Jan 2013 09:08
Last Modified: 23 Jan 2013 09:25

Update Item Update Item