A shogi program based on Monte-Carlo Tree Search

ICGA Journal

Volumn 33, Issue 2, 2010, Pages 80-92

  Sato, Yoshikuni ^a   Takahashi, Daisuke ^a   Grimbergen, Reijer ^b  

^a UNIVERSITY OF TSUKUBA   (Japan)

^b TOKYO UNIVERSITY OF TECHNOLOGY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 79551493932     PISSN: 13896911     EISSN: None     Source Type: Journal    
DOI: 10.3233/ICG-2010-33203     Document Type: Article

References (21)

1. Akl, S. and Newborn, M. (1977). The Principal Continuation and the Killer Heuristic. ACM'77: Proceedings of the 1977 annual conference, pp. 466-473.
2. Auer, P., Cesa-Bianchi, N., and Fischer, P. (2002). Finite-time Analysis of the Multiarmed Bandit Problem. Machine Learning, Vol. 47, Nos. 2-3, pp. 235-256.
3. Cazenave, T. and Saffidine, A. (2009). Utilisation de la recherche arborescente Monte-Carlo au Hex. Revue d'Intelligence Artificielle, Vol. 23, Nos. 2-3, pp. 183-202. (in French).
4. Ciancarini, P. and Favini, G. (2009). Monte Carlo Tree Search Techniques in the Game of Kriegspiel. Proceedings of the 21st International Joint Conference on Artifical intelligence, pp. 474-479.
5. Coulom, R. (2006). Efficient Selectivity and Backup Operators in Monte-Carlo Tree Search. 5th International Conference on Computer and Games, LNCS 4630, pp. 72-83, Turin, Italy.
6. Coulom, R. (2007). Computing "Elo Ratings" of Move Patterns in the Game of Go. ICGA Journal, Vol. 30, No. 4, pp. 198-208.
7. Daiwa Cup (2007). http://www.daiwashogi.net/. (In Japanese).
8. Gelly, S. and Silver, D. (2007). Combining online and offline knowledge in UCT ICML '07: Proceedings of the 24th international conference on Machine learning, pp. 273-280.
9. Gelly, S., Wang, Y., Munos, R., and Teytaud, O. (2006). Modification of UCT with Patterns in Monte-Carlo Go. Technical Report RR-6062, INRIA.
10. Hashimoto, J., Hashimoto, T., and Nagashima, J. (2006). A Potential Application of Monte-Carlo Method in Computer Shogi. The 11th Game Programming Workshop, pp. 195-198. (In Japanese).
11. Hoki, K. (2006). Optimal Control of Minimax Search Results to Learn Positional Evaluation. The 11th Game Programming Workshop, pp. 78-83. (In Japanese).
12. Kocsis, L. and Szepesvári, C. (2006). Bandit based Monte-Carlo Planning. 15th European Conference on Machine Learning (ECML), pp. 282-293.
13. Lorentz, R. (2008). Amazons Discover Monte-Carlo. Computers and Games Conference 2008 (eds. H. van den Herik, X. Xu, Z. Ma, and M. Winands), LNCS 5131, pp. 13-24, Springer, Heidelberg.
14. Matsubara, H. (1998). Computer Shogi Progress 2. Kyoritsu Shuppan. (In Japanese).
15. Schaeffer, J. (1983). The History Heuristic. Journal of the International Computer Chess Association, Vol. 6, No. 3, pp. 16-19.
16. Shogi Town (1999). http://www.shogitown.com/school/judge/judgetop.html. (In Japanese).
17. Sturtevant, N. (2008). An Analysis of UCT in Multi-Player Games. ICGA Journal, Vol. 31, No. 4, pp. 195-208.
18. Teytaud, F. and Teytaud, O. (2010). Creating on Upper-Confidence-Tree Program for Havannah. Advances in Computer Games 12 (eds. H. van den Herik and P. Spronck), LNCS 6048, pp. 65-74, Springer, Heidelberg.
19. Watanabe, A. (2007). http://blog.goo.ne.jp/kishi-akira/. (In Japanese).
20. Winands, M., Björnsson, Y., and Saito, J. (2008). Monte-Carlo Tree Search Solver. Computers and Games Conference 2008 (eds. H. van den Herik, X. Xu, Z. Ma, and M. Winands), LNCS 5131, pp. 25-36, Springer, Heidelberg.
21. Winands, M. and Björnsson (2009). Evaluation Function Based Monte-Carlo LOA. Advances in Computer Games, LNCS 6048, pp. 33-44.