Monte-Carlo go developments

IFIP Advances in Information and Communication Technology

Volumn 135, Issue , 2004, Pages 159-174

  Bouzy, B ^a   Helmstetter, B ^b  

^a UNIVERSITÉ PARIS DESCARTES   (France)

^b UNIVERSITÉ PARIS 8   (France)

Author keywords

Computer Go; Heuristics; Monte Carlo approach

Indexed keywords

HEURISTIC PROGRAMMING; KNOWLEDGE BASED SYSTEMS; MONTE CARLO METHODS; SIMULATED ANNEALING;

ALL MOVES AS FIRSTS; COMPUTER GO; CONSTANT TEMPERATURE; HEURISTICS; KNOWLEDGE BASED PROGRAMS; MONTE CARLO APPROACH; MONTE CARLO PROGRAMS; TREE SEARCH;

COMPUTER GAMES;

EID: 84902513084     PISSN: 18684238     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-0-387-35706-5_11     Document Type: Conference Paper

References (16)

1. Abramson, B. (1990). Expected-outcome: a general model of static evaluation. IEEE transactions on PAMI, Vol. 12, pp. 182-193.
2. Billings, D., Davidson, A., Schaeffer, J., and Szafron, D. (2002). Thechallenge ofpoker. Artificial Intelligence, Vol. 134, pp. 201-240.
3. Bouzy, B. (2002). Indigo home page. http://www.math-info.univ-paris5.fr/6ouzy/INDIGO.html.
4. Bouzy, B. (2003). The move decision process of Indigo. ICGA Joumal, Vol. 26, No. 1, pp. 14-27.
5. Bouzy, B. and Cazenave, T. (2001). Computer Go: an Al oriented survey. Artificial Intelligence, Vol. 132, pp. 39-103.
6. Bruegmann, B. (1993). Monte Carlo Go. http://www.joy.ne.jp/welcome/igs/Go/computer/mcgo.tex.
7. Bump, D. (2003). Gnugo home page. http://www.gnu.org/software/gnugo/devel.html.
8. Chen, K. and Chen, Z. (1999). Static analysis of life and death in the game of Go. lnforrnation Sciences, Vol. 121, Nos. 1-2, pp. 113-134.
9. Fishman (1996). Monte-Carlo: Concepts, Algorithms, Applications. Springer-Verlag, Berlin, Germany.
10. Fotland, D. (2002). Static Eye in The Many Faces of Go. ICGA Joumal, Vol. 25, No. 4, pp. 203-210.
11. Junghanns, A. (1998). Are there Practical Alternatives to Alpha-Beta? ICCA Journal, Vol. 21, No. 1, pp. 14-32.
12. Kaminski, P. (2003). Vegos home page. http://www.ideanest.com/vegos/.
13. Kirkpatrick, S., Gelatt, C.D., and Vecchi, M.P. (1983). Optimization by Simulated Annealing. Science.
14. Rivest, R. (1988). Game-tree searching by min-max approximation. Artificial Intelligence, Vol. 34, No. 1, pp. 77-96.
15. Sheppard, B. (2002). World-championship-caliber Scrabble. Artificial Intelligence, Vol. 134, Nos. 1-2, pp. 241-275.
16. Tesauro, G. (2002). Programming backgarnmon using self-teaching neural nets. Artificial Intelligence, Vol. 134, Nos. 1-2, pp. 181-199.