All-Moves-As-First heuristics in Monte-Carlo go

Proceedings of the 2009 International Conference on Artificial Intelligence, ICAI 2009

Volumn 2, Issue , 2009, Pages 605-610

  Helmbold, David P ^a   Parker Wood, Aleatha ^a  

^a University of California Santa Cruz   (United States)

Author keywords

All Moves As First; Computer Go; Heuristic search; Monte Carlo Tree Search; UCT

Indexed keywords

ALL-MOVES-AS-FIRST; COMPUTER GO; HEURISTIC SEARCH; TREE SEARCH; UCT;

HEURISTIC ALGORITHMS;

ARTIFICIAL INTELLIGENCE;

EID: 80054029477     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (8)

1. Peter Auer, Nicolò Cesa-Bianchi, and Paul Fischer. Finite-time analysis of the multiarmed bandit problem. Mach. Learn,, 47(2-3):235-256, 2002.
2. Bernd Brügmann. Monte carlo go, October 1993.
3. Guillaume Chaslot, Louis Chatriot, C. Fiter, Sylvain Gelly, Jean-Baptiste Hoock, Julien Perez, Arpad Rimmel, and Olivier Teytaud. Combining expert, offline, transient and online knowledge in monte-carlo exploration, http://www.lri.fr/tey-taud/eg.pdf.
4. Xindi Cai and Donald C. Wunsch II. Computer Go: A Grand Challenge to AI, volume 63 of Studies in Computational Intelligence (SCI), pages 443-465. Springer, 2007.
5. Jennifer Flynn. Independent study quarterly reports. http://users.soe. ucsc.edu/~charlie/projects/SlugGo/, 2008.
6. Sylvain Gelly and David Silver. Combining online and offline knowledge in uct. In ICML '07: Proceedings of the 24th Internatinoal Conference on Machine learning, pages 273-280. ACM, 2007.
7. L. Kocsis and Cs. Szepesvári. Bandit based monte-carlo planning. In Machine Learning: ECML 2006, number 4212 in LNCS, pages 282-293. Springer, 2006.
8. Łukasz Lew. Library of effective go routines (libEGO). http://www.mimuw.edu.pl/~lew/, 2009.