Combining UCT and nested Monte Carlo search for single-player general game playing

IEEE Transactions on Computational Intelligence and AI in Games

Volumn 2, Issue 4, 2010, Pages 271-277

  Méhat, Jean ^a   Cazenave, Tristan ^b  

^a UNIVERSITÉ PARIS 8   (France)

^b UNIVERSITÉ PARIS DAUPHINE   (France)

Author keywords

General Game Playing (GPP); nested Monte Carlo search; single player games; upper confidence bounds for trees (UCT)

Indexed keywords

GAME THEORY;

GAME PLAYING; GENERAL GAME PLAYING; GENERAL GAME PLAYING (GGP); MONTE CARLO TREE SEARCH (MCTS); NESTED MONTE-CARLO; SINGLE-PLAYER GAMES; TRANSPOSITION TABLE; UPPER CONFIDENCE BOUND;

MONTE CARLO METHODS;

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

References (23)

1. Dresden GGP Server, 2010 [Online]. Available: http://euklid.inf. tudresden. de:8180/ggpserver/
2. E. Berlekamp, J. H. Conway, and R. K. Guy, Winning Ways. New York: Academic, 1982.
3. Y. Björnsson and H. Finnsson, "Cadiaplayer: A simulation-based general game player," IEEE Trans. Comput. Intell. AI Games, vol. 1, no. 1, pp. 4-15, Mar. 2009.
4. T. Cazenave, "Reflexive Monte-Carlo search," in Proc. Comput. Games Workshop, Amsterdam, The Netherlands, 2007, pp. 165-173.
5. T. Cazenave, "Nested Monte-Carlo search," in Proc. Int. Joint Conf. Artif. Intell., 2009, pp. 456-461.
6. T. Cazenave and A. Saffidine, "Utilisation de la recherche arborescente Monte-Carlo au Hex," Revue d'Intelligence Artificielle, vol. 23, no. 2-3, pp. 183-202, 2009.
7. G. Chaslot, L. Chatriot, C. Fiter, S. Gelly, J.-B. Hoock, J. Perez, A. Rimmel, and O. Teytaud, "Combiner connaissances expertes, hors-ligne, transientes et en ligne pour l'exploration Monte-Carlo. apprentissage et mc," Revue d'Intelligence Artificielle, vol. 23, no. 2-3, pp. 203-220, 2009.
8. B. E. Childs, J. H. Brodeur, and L. Kocsis, "Transpositions and move groups in Monte Carlo tree search," in Proc. IEEE Symp. Comput. Intell. Games, 2008, pp. 389-395.
9. J. Clune, "Heuristic evaluation functions for general game playing," in Proc. AAAI Conf. Artif. Intell., 2007, pp. 1134-1139.
10. R. Coulom, "Efficient selectivity and back-up operators in Monte-Carlo tree search," in Computers and Games 2006, ser. Lecture Notes in Computer Science. Berlin, Germany: Springer-Verlag, 2006, vol. 4630, pp. 72-83.
11. R. Coulom, "Computing "elo ratings" of move patterns in the game of go," Int. Comput. Games Assoc. J., vol. 30, no. 4, pp. 198-208, 2007.
12. H. Finnsson and Y. Björnsson, "Simulation-based approach to general game playing," in Proc. AAAI Conf. Artif. Intell., 2008, pp. 259-264.
13. S. Gelly and D. Silver, "Combining online and offline knowledge in UCT," in Proc. Int. Conf. Mach. Learn., 2007, pp. 273-280.
14. S. Gelly and D. Silver, "Achieving master level play in 9× 9 computer go," in Proc. AAAI Conf. Artif. Intell., 2008, pp. 1537-1540.
15. C. P. Gomes and B. Selman, "Algorithm portfolio design: Theory vs. practice," in Proc. Conf. Uncertainty Artif. Intell., 1997, pp. 190-197.
16. L. Kocsis and C. Szepesvàri, "Bandit based Monte-Carlo planning," in ECML, ser. Lecture Notes in Computer Science. Berlin, Germany: Springer-Verlag, 2006, vol. 4212, pp. 282-293.
17. C. S. Lee, M. H. Wang, G. Chaslot, J. B. Hoock, A. Rimmel, O. Teytaud, S. R. Tsai, S. C. Hsu, and T. P. Hong, "The computational intelligence of mogo revealed in Taiwan's computer go tournaments," IEEE Trans. Comput. Intell. AI Games, vol. 1, no. 1, pp. 73-89, Mar. 2009.
18. K. Leyton-Brown, E. Nudelman, G. Andrew, J. McFadden, and Y. Shoham, "A portfolio approach to algorithm selection," in Proc. Int. Joint Conf. Artif. Intell., 2003, vol. 18, pp. 1542-1543.
19. N. Love, T. Hinrichs, and M. Genesereth, "General Game Playing: Game description language specification," Stanford Univ., Stanford, CA, Tech. Rep., 2006.
20. M. P. D. Schadd, M. H. M. Winands, H. J. van den Herik, G. Chaslot, and J. W. H. M. Uiterwijk, "Single-player Monte-Carlo tree search," in Proceedings of the 6th International Conference on Computers and Games. Berlin, Germany: Springer-Verlag, 2008, pp. 1-12.
21. S. Schiffel and M. Thielscher, "Fluxplayer: A successful general game player," in Proc. AAAI Conf. Artif. Intell., 2007, pp. 1191-1196.
22. M. Thielscher, "Answer set programming for single-player games in general game playing," in Proc. 25th Int. Conf. Logic Programm., 2009, pp. 327-341.
23. L. Xu, F. Hutter, H. H. Hoos, and K. Leyton-Brown, "SATzilla: Portfolio-based algorithm selection for SAT," J. Artif. Intell. Res., vol. 32, no. 1, pp. 565-606, 2008.