Monte-Carlo strategies for computer go

Belgian/Netherlands Artificial Intelligence Conference

Volumn , Issue , 2006, Pages

  Chaslot, Guillaume ^a   Saito, Jahn Takeshi ^a   Uiterwijk, Jos W H M ^a   Bouzy, Bruno ^b   van den Herik, H Jaap ^a  

^a MAASTRICHT UNIVERSITY   (Netherlands)

^b UNIVERSITÉ PARIS DESCARTES   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER GO; EVALUATION FUNCTION; EXPLORATION AND EXPLOITATION; MINIMAX; MONTE CARLO;

BACKPROPAGATION ALGORITHMS; SIMULATED ANNEALING;

ARTIFICIAL INTELLIGENCE;

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

References (17)

1. L. Victor Allis, Maarte van der Meulen, and H. Jaap van den Herik. Proof-number search. Artificial Intelligence, 66:91-124, 1994.
2. Bruno Bouzy. Associating domain-dependent knowledge and Monte Carlo approaches within a Go program. Joint Conference on Information Sciences, 2003.
3. Bruno Bouzy. Associating shallow and selective global tree search with Monte Carlo for 9x9 Go. In K. Chen, editor, Proceedings of 4th Computer and Games Conference, Ramat-Gan, 2004.
4. Bruno Bouzy. Move pruning techniques for Monte-Carlo Go. In Proceedings of the 11th Advances in Computer Game conference, page 15, 2005.
5. Bruno Bouzy and Guillaume Chaslot. Monte-Carlo Go Reinforcement Learning Experiments. In G. Kendall and S. Louis, editors, IEEE 2006 Symposium on Computational Intelligence in Games, Reno, USA, 2006.
6. Bruno Bouzy and Bernard Helmstetter. Monte Carlo Go Developments. In H. Jaap van den Herik, Hiroyuki Iida, and Ernst A. Heinz, editors, Proceedings of the Advances in Computer Games Conference (ACG-10), pages 159-174. Kluwer Academic, 2003.
7. Bernd Brügmann. Monte Carlo Go. White paper, 1993.
8. Tristan Cazenave. Automatic acquisition of tactical Go rules. 3rd Game Programming Workshop in Japan, Hakone, 1996.
9. Jonathan Schaeffer Duane Szafron Darse Billings, Aaron Davidson. The challenge of poker. Artificial Intelligence, 134(1):201-240, 2002.
10. Shun-Chin Hsu Jeng-Chi Yan and H. Jaap van den Herik. The sacrifice move. ICGA Journal, 28(4):223-234, 2005.
11. S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi. Optimization by simulated annealing. Science, pages 671-680, 1983.
12. Michael Buro Michael Chung and Jonathan Schaeffer. Monte Carlo Planning in RTS games. In Simon Lucas and Graham Kendall, editors, Proceeding of the IEEE Symposium on Computational Intelligence and Games, 2005.
13. Martin Müller. Pattern matching in Explorer: Extended abstract. In Proceedings of the Game Playing System Workshop, pages 1-3. ICOT, 1991.
14. Martin Müller. Not like other games - why tree search in Go is different. In Fifth Joint Conference on Information Sciences (JCIS), 2000.
15. Judea Pearl. The solution for the branching factor of the alpha-beta pruning algorithm and its optimality. Communications of the ACM, 25:559-564, 1982.
16. Brian Sheppard. World-championship-caliber scrabble. Artificial Intelligence, 134(1):241-275, 2002.
17. Stephen Smith, Dana Nau, and Tom Throop. Computer Bridge - A Big Win for AI planning. AI Magazine, 19(2):93-105, 1998.