The Grand Challenge of Computer Go: Monte Carlo Tree Search and Extensions - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Communications of the ACM Year : 2012

The Grand Challenge of Computer Go: Monte Carlo Tree Search and Extensions

Abstract

The ancient oriental game of Go has long been considered a grand challenge for artificial intelligence. For decades, com- puter Go has defied the classical methods in game tree search that worked so successfully for chess and checkers. How- ever, recent play in computer Go has been transformed by a new paradigm for tree search based on Monte-Carlo meth- ods. 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.
Fichier principal
Vignette du fichier
CACM-MCTS.pdf (576.41 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-00695370 , version 1 (08-05-2012)
hal-00695370 , version 2 (19-08-2012)
hal-00695370 , version 3 (19-02-2013)

Identifiers

  • HAL Id : hal-00695370 , version 3

Cite

Sylvain Gelly, Marc Schoenauer, Michèle Sebag, Olivier Teytaud, Levente Kocsis, et al.. The Grand Challenge of Computer Go: Monte Carlo Tree Search and Extensions. Communications of the ACM, 2012, 55 (3), pp.106-113. ⟨hal-00695370v3⟩
636 View
3137 Download

Share

Gmail Mastodon Facebook X LinkedIn More