Gelly, S and Kocsis, Levente and Schoenauer, M and Sebag, M and Silver, D and Szepesvári, C and Teytaud, O (2012) The grand challenge of computer go: Monte Carlo tree search and extensions. COMMUNICATIONS OF THE ACM, 55 (3). pp. 106-113. ISSN 0001-0782 10.1145/2093548.2093574

Full text not available from this repository.

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. © 2012 ACM.

Item Type:	ISI Article
Uncontrolled Keywords:	Artificial intelligence, Computer science, Computer applications, Tree search, State of the art, Monte Carlo, Grand Challenge, Game tree search, Computer Go, Classical methods
Subjects:	Q Science > QA Mathematics and Computer Science > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány
Divisions:	?? R104a ??
Depositing User:	EPrints Admin
Date Deposited:	16 Jan 2014 10:30
Last Modified:	05 Feb 2014 12:28
URI:	https://eprints.sztaki.hu/id/eprint/7365

Update Item