Jump to Content

The grand challenge of computer Go: Monte Carlo tree search and extensions

Sylvain Gelly
Levente Kocsis
Marc Schoenauer
Michele Sebag
David Silver
Csaba Szepesvári
Olivier Teytaud
Communications of the ACM, vol. Volume 55 Issue 3 (2012), pp. 106-113


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.

Research Areas