The power of forgetting: Improving the last-good-reply policy in Monte Carlo go

IEEE Transactions on Computational Intelligence and AI in Games

Volumn 2, Issue 4, 2010, Pages 303-309

  Baier, Hendrik ^a   Drake, Peter D ^b  

^a UNIVERSITY OF OSNABRÜCK   (Germany)

^b LEWIS AND CLARK COLLEGE   (United States)

Author keywords

Board games; Go; machine learning; Monte Carlo methods

Indexed keywords

BOARD GAMES; GO; MACHINE-LEARNING; MONTE CARLO; RANDOM SAMPLING; SEARCH TREES; TREE SEARCH;

LEARNING SYSTEMS; TREES (MATHEMATICS);

MONTE CARLO METHODS;

EID: 78951482410     PISSN: 1943068X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCIAIG.2010.2100396     Document Type: Article

References (19)

1. H. Baier, "Adaptive playout policies for Monte Carlo Go,"M.S. thesis, Inst. Cogn. Sci., Osnabrück Univ., Osnabrück, Germany, 2010.
2. K. Baker, The Way to Go, 7th ed. New York: American Go Association, 2008.
3. B. Bouzy and G. Chaslot, "Monte-Carlo Go reinforcement learning experiments," in Proc. IEEE Symp. Comput. Intell. Games, Reno, NV, 2006, pp. 187-194.
4. B. Brügmann, "Monte Carlo Go," 1993 [Online]. Available: http://www.ideanest.com/vegos/MonteCarloGo.pdf
5. X. Cai and D. Wunsch, "Computer Go: A grand challenge to AI," Studies in Comput. Intell., vol. 63, pp. 443-465, 2007.
6. G. M. J.-B. Chaslot, C. Fiter, J.-B. Hoock, A. Rimmel, and O. Teytaud, "Adding expert knowledge and exploration in Monte-Carlo tree search," in Proc. 12th Annu. Adv. Comput. Games Conf., Pamplona, Spain, May 11-13, 2009, pp. 1-13.
7. R. Coulom, "Efficient selectivity and backup operators in Monte-Carlo tree search," in Lecture Notes in Computer Science. Berlin, Germany: Springer-Verlag, 2007, vol. 4630, pp. 72-83.
8. R. Coulom, "Computing Elo ratings of move patterns in the game of Go," in Proc. Comput. Games Workshop, H. J. van den Herik, M. Winands, J. Uiterwijk, and M. Schadd, Eds., 2007, pp. 113-124.
9. P. Drake, "The last-good-reply policy for Monte-Carlo Go," Int. Comput. Games Assoc. J., vol. 32, no. 4, pp. 221-227, Dec. 2009.
10. P. Drake, A. Hersey, and N. Sylvester, "Orego Go Program," [Online]. Available: http://legacy.lclark.edu/∼drake/Orego.html
11. H. Finnsson and Y. Björnsson, "Simulation control in general game playing agents," in Proc. IJCAI Workshop General Game Playing, 2009, pp. 21-26.
12. C. Garlock, "Computer beats pro at U.S. Go Congress," Amer. Go E J., vol. 9, no. 40, 2008.
13. S. Gelly, Y. Wang, R. Munos, and O. Teytaud, "Modification of UCT with patterns in Monte-Carlo Go," INRIA, France, Tech. Rep. 6062, 2006.
14. S. Gelly and D. Silver, "Combining offline and online knowledge in UCT," in Proc. 24th Int. Conf. Mach. Learn., 2007, pp. 273-280.
15. J. Hashimoto, T. Hashimoto, and H. Iida, "Context killer heuristic and its application to computer shogi," in Proc. Comput. Games Workshop, H. J. van den Herik, M. Winands, J. Uiterwijk, and M. Schadd, Eds., 2007, pp. 39-48.
16. L. Kocsis and C. Szepesvári, "Bandit based Monte-Carlo planning," in Proc. 15th Eur. Conf. Mach. Learn., 2006, pp. 282-293.
17. M. Müller, "Computer Go," Artif. Intell., vol. 134, no. 1-2, pp. 145-179, 2002.
18. A. Rimmel and F. Teytaud, "Multiple overlapping tiles for contextual Monte Carlo tree search," in Lecture Notes in Computer Science. Berlin, Germany: Springer-Verlag, 2010, vol. 6024, pp. 201-210.
19. S. Russell and P. Norvig, Artificial Intelligence: A Modern Approach, 3rd ed. Upper Saddle River, NJ: Pearson, 2010, pp. 170-171.