Playing Amazons endgames

ICGA Journal

Volumn 32, Issue 3, 2009, Pages 140-148

  Kloetzer, Julien ^a   Iida, Hiroyuki ^a   Bouzy, Bruno ^b  

^a JAPAN ADVANCED INSTITUTE OF SCIENCE AND TECHNOLOGY   (Japan)

^b Huawei Technologies Co   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE;

COMPUTING PROCESS; CURRENT PROJECTS; GAME PLAYING; MINIMAX; MONTE CARLO TREE SEARCH (MCTS); MONTE-CARLO TREE SEARCHES; SUBDOMAIN;

MONTE CARLO METHODS;

EID: 77949732413     PISSN: 13896911     EISSN: None     Source Type: Journal    
DOI: 10.3233/ICG-2009-32303     Document Type: Article

References (18)

1. Allis, L. V., Meulen, M. van der, and Herik, H. J. van den (1994). Proof-number search. Artificial Intelligence, Vol.66, No.1, pp. 91-124.
2. Avetisyan, H. and Lorentz, R. (2003). Selective Search in an Amazons Program. Lecture Notes in Computer Science, pp. 123-141, Springer.
3. Berlekamp, E., Conway, J., and Guy, R. (1982). Winning Ways for Your Mathematical Plays. Academic Press, London, UK. Second edition (2004): A.K. Peters.
4. Chaslot, G. M. J., Winands, M. H. M., Herik, H. J. van den, Uiterwijk, J., and Bouzy, B. (2008). Progressive Strategies for Monte-Carlo Tree-Search. New Mathematics and natural Computation, Vol.4, No.3, pp. 343-357.
5. Conway, J. (1976). On Numbers And Games. Academic Press, London, UK.
6. Coulom, R. (2007). Efficient Selectivity and Backup Operators in Monte-Carlo Tree Search. Lecture Notes in Computer Science, Vol.4630, pp. 72-83.
7. Hashimoto, T., Kajihara, Y., Sasaki, N., Iida, H., and Yoshimura, J. (2001). An evaluation function for amazons. Advances in Computer Games, Vol.9, pp. 191-202.
8. Kloetzer, J., Iida, H., and Bouzy, B. (2007). The Monte-Carlo Approach in Amazons. Computer Games Work- shop, Amsterdam, The Netherlands, pp. 113-124.
9. Kloetzer, J., Iida, H., and Bouzy, B. (2008). A Comparative Study of Solvers in Amazons Endgames. Proceedings of the IEEE 2008 Symposium on Computational Intelligence and Games, Perth.
10. Knuth, D. and Moore, R. (1975). An analysis of alpha-beta pruning. Artificial Intelligence, Vol.6, pp. 293-326.
11. Kocsis, L. and Szepesvári, C. (2006). Bandit Based Monte-Carlo Planning. Lecture Notes in Computer Science, Vol.4212, pp. 282-293.
12. Lieberum, J. (2005). An evaluation function for the game of amazons. Theoretical Computer Science, Vol.349, No.2, pp. 230-244.
13. Lorentz, R. (2008). Amazons discover Monte-Carlo. Proceedings of the 6th international conference on Com- puters and Games, Beijing, China, pp. 13-24, Springer-Verlag, Heidelberg, Germany.
14. Müller, M., Enzenberger, M., and Schaeffer, J. (2004). Temperature discovery search. Nineteenth National Conference on Artificial Intelligence (AAAI 2004), pp. 658-663.
15. Müller, M. and Tegos, T. (2002). Experiments in computer amazons. More Games of No Chance, pp. 243-260.
16. Nagai, A. (2002). Df-pn Algorithm for Searching AND/OR Trees and Its Applications. Ph.D. thesis, Department of Information Science, University of Tokyo.
17. Ueda, T., Hashimoto, T., Hashimoto, J., and Iida, H. (2008). Weak Proof-Number Search. Proceedings of the 6th international conference on Computers and Games, Beijing, China, pp. 157-168, Springer-Verlag, Heidelberg, Germany.
18. Zhang, P. and Chen, K. S. (2007). Monte-Carlo Go Tactic Search. Proceedings of the 10th Joint Conference on Information Sciences (JCIS 2007), pp. 662-670.