Evaluation of Monte Carlo tree search and the application to go

2008 IEEE Symposium on Computational Intelligence and Games, CIG 2008

Volumn , Issue , 2008, Pages 191-198

  Takeuchi, Shogo ^a   Kaneko, Tomoyuki ^a   Yamaguchi, Kazunori ^a  

^a UNIVERSITY OF TOKYO   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER GO; GAME PROGRAMMING; GAME RECORDS; LARGE DATABASE; MONTE CARLO; OTHELLO; SEARCH METHOD; TREE SEARCH;

ARTIFICIAL INTELLIGENCE; COMPUTATIONAL METHODS; GAME THEORY; NUMERICAL METHODS;

MONTE CARLO METHODS;

EID: 70349294174     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CIG.2008.5035639     Document Type: Conference Paper

References (24)

1. J. Schaeffer, "The games computers (and people) play," Advances in Computers, vol.50, pp. 189-266, 2000.
2. M. Müller, "Computer go," Artificial Intelligence, vol.134, no.1-2, pp. 145-179, Jan. 2002.
3. S. Gelly and D. Silver, "Achieving master level play in 9×9 computer go," in Proceedings of AAAI, 2008, pp. 1537-1540.
4. L. Kocsis and C. Szepesvari, "Bandit based Monte-Carlo planning," in Machine Learning: ECML 2006, vol.4212. Springer, 2006, pp. 282-293.
5. S. Takeuchi, T. Kaneko, K. Yamaguchi, and S. Kawai, "Visualization and adjustment of evaluation functions based on evaluation values and win probability," in Proceedings of the Twenty- Second National Conference on Artificial Intelligence (AAAI- 2007), 2007, pp. 858-863. [Online]. Available: http://www.graco.c.utokyo.ac.jp/%7ekaneko/papers/AAAI13TakeuchiS.pdf
6. M. L. Ginsberg, "GIB: steps toward an expert-level bridge-playing program," in Sixteenth International Joint Conference on Artificial Intelligence, 1999, pp. 584-589.
7. B. Sheppard, "World-championship-caliber Scrabble," Artificial Intelligence, vol.134, no.1-2, pp. 241-275, 2002.
8. D. Billings, A. Davidson, J. Schaeffer, and D. Szafron, "The challenge of poker," Artificial Intelligence, vol.134, no.1-2, pp. 201-240, 2002.
9. B. Abramson, "Expected-outcome: A general model of static evaluation." IEEE Trans. Pattern Analysis and Mach. Intell., vol.12, no.2, pp. 182-193, 1990.
10. B. Brügmann, "Monte Carlo Go," Physics Department, Syracuse University, Tech. Rep., 1993.
11. B. Bouzy and B. Helmstetter, "Monte Carlo Go developments," in Advances in Computer Games. Many Games, Many Challenges. Kluwer Academic Publishers, 2003, pp. 159-174.
12. H. Yoshimoto, K. Yoshizoe, T. Kaneko, A. Kishimoto, and K. Taura, "Monte Carlo Go has a way to go," in Proceedings of the Twenty-First National Conference on Artificial Intelligence (AAAI-2006), 2006, pp. 1070-1075.
13. R. Coulom, "Efficient selectivity and backup operators in Monte-Carlo tree search," in Computers and Games, ser. Lecture Notes in Computer Science, H. J. van den Herik, P. Ciancarini, and H. H. L. M. Donkers, Eds., vol.4630. Springer, 2006, pp. 72-83.
14. S. Gelly, Y. Wang, R. Munos, and O. Teytaud, "Modification of uct with patterns in Monte-Carlo Go," INRIA, Tech. Rep. RR-6062, 2006.
15. Chaslot, M. H. Winands, I. Szita, and J. H. van den Herik, "Parameter tuning by the cross-entropy method," in Proceedings of EWRL. Springer, 2008. [Online]. Available: http://www.cs.unimaas.nl/g.chaslot/ papers%5Cewrl.pdf.
16. R. Coulom, "Computing elo ratings of move patterns in the game of go," in Computer Games Workshop, Amsterdam / The Netherlands, 2007.
17. D. Silver, R. Sutton, and M. Müller, "Sample-based learning and search with permanent and transient memories," in Proceedings of the 25th Annual International Conference on Machine Learning (ICML 2008), A. McCallum and S. Roweis, Eds. Omnipress, 2008, pp. 968-975.
18. N. Araki, "Move prediction and strength in Monte-Carlo Go program," Master Thesis, the Graduate School the University of Tokyo, 2008. [Online]. Available: http://ark.qp.land.to/main.pdf
19. M. Buro, "Improving heuristic mini-max search by supervised learning," Artificial Intelligence, vol.134, no.1-2, pp. 85-99, Jan. 2002.
20. J. van Rijswijck, "Learning from perfection: A data mining approach to evaluation function learning in awari," in Computer and Games, ser. LNCS, T. A. Marsland and I. Frank, Eds., no.2063. Hamamatsu, Japan: Springer-Verlag, Oct. 2001, pp. 115-132.
21. D. Gomboc, M. Buro, and T. A. Marsland, "Tuning evaluation functions by maximizing concordance," Theor. Comput. Sci., vol.349, no.2, pp. 202-229, 2005.
22. M. Vuk and T. Curk, "Roc curve, lift chart and calibration plot," Metodolo?ski zvezki, vol.3, no.1, pp. 89-108, 2006.
23. T. Fawcett, "An introduction to roc analysis," Pattern Recogn. Lett., vol.27, no.8, pp. 861-874, 2006.
24. R. Caruana and A. Niculescu-Mizil, "An empirical comparison of supervised learning algorithms using different performance metrics," in ICML '06: Proceedings of the twenty-third International Conference on Machine Learning, 2006, pp. 161-168.