Playing the right atari

ICGA Journal

Volumn 30, Issue 1, 2007, Pages 35-42

  Cazenave, Tristan ^a,b  

^a Université Paris 8 ^*

^b UNIVERSITÉ PARIS 8   (France)

Author keywords

[No Author keywords available]

Indexed keywords

TREE SEARCH;

HEURISTIC PROGRAMMING;

EID: 34250654155     PISSN: 13896911     EISSN: None     Source Type: Journal    
DOI: 10.3233/icg-2007-30104     Document Type: Article

References (9)

1. Bouzy, B. (2005). Associating domain-dependent knowledge and Monte Carlo approaches within a go program. Information Sciences, Vol. 175, No. 4, pp. 247-257.
2. Bouzy, B. (2006). Associating shallow and selective global tree search with Monte Carlo for 9×9 go. Computers and Games: 4th International Conference, CG 2004 (eds. H. J. van den Herik, Y. Björnsson, and N. S. Netanyahu), Volume 3846 of LNCS, pp. 67-80, Springer-Verlag, Berlin.
3. Brügmann, B. (1993). Monte Carlo Go. ftp://ftp-igs.joyjoy.net/go/ computer/mcgo.tex.z.
4. Cazenave, T. (2007). Virtual Global Search: Application to 9×9 Go. Proceedings Computers and Games 2007 (eds. H. J. van den Herik, P. Ciancarini, and H. H. L. M. Donkers), Springer-Verlag, Berlin.
5. Cazenave, T. and Helmstetter, B. (2005). Combining tactical search and Monte-Carlo in the game of Go. CIG'05, pp. 171-175, Colchester, UK.
6. Coulom, R. (2007). Efficient Selectivity and Back-up Operators in Monte-Carlo Tree Search. Proceedings Computers and Games 2006 (eds. H. J. van den Herik, P. Ciancarini, and H. H. L. M. Donkers), Springer-Verlag, Berlin.
7. Gelly, S. and Wang, Y. (2006). Exploration exploitation in Go: UCT for Monte-Carlo Go. NIPS-2006 : On-line trading of Exploration and Exploitation Workshop, Whistler, Canada.
8. Gelly, S., Wang, Y., Munos, R., and Teytaud, O. (2006). Modification of UCT with Patterns in Monte-Carlo Go. Technical Report 6062, INRIA.
9. Kocsis, L. and Szepesvári, C. (2006). Bandit based monte-carlo planning. Machine Learning: ECML 2006, Lecture Notes in Artificial Intelligence 4212 (eds. J. Fürnkranz, T. Scheffer, and M. Spiliopoulou), pp. 282-293.