2012 TheGrandChallengeofComputerGoMo

• (Gelly et al., 2012) ⇒ Sylvain Gelly, Levente Kocsis, Marc Schoenauer, Michèle Sebag, David Silver, Csaba Szepesvári, and Olivier Teytaud. (2012). “The Grand Challenge of Computer Go: Monte Carlo Tree Search and Extensions.” In: Communications of the ACM Journal, 55(3). doi:10.1145/2093548.2093574

Subject Headings: Monte Carlo Tree Search.

Cited By

• http://scholar.google.com/scholar?q=%222012%22+The+Grand+Challenge+of+Computer+Go%3A+Monte+Carlo+Tree+Search+and+Extensions
• http://dl.acm.org/citation.cfm?id=2093548.2093574&preflayout=flat#citedby

Quotes

Abstract

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.

References

;

	Author	volume	Date Value	title	type	journal	titleUrl	doi	note	year
2012 TheGrandChallengeofComputerGoMo	Michèle Sebag David Silver Sylvain Gelly Levente Kocsis Marc Schoenauer Csaba Szepesvári Olivier Teytaud			The Grand Challenge of Computer Go: Monte Carlo Tree Search and Extensions				10.1145/2093548.2093574		2012