The Grand Challenge of Computer Go: Monte Carlo Tree Search and Extensions - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue Communications of the ACM Année : 2012

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

Résumé

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
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

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

Identifiants

  • HAL Id : hal-00695370 , version 3

Citer

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 Consultations
3063 Téléchargements

Partager

Gmail Facebook X LinkedIn More