Revisiting Monte-Carlo tree search on a normal form game: NoGo

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6624 LNCS, Issue PART 1, 2011, Pages 73-82

  Chou, C W ^b   Teytaud, O ^a   Yen, S J ^b  

^a UFR 919 Laboratoire d'Informatique Pour la Mécanique et les Sciences de l'Ingénieur   (France)

^b NATIONAL DONG HWA UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

MONTE CARLO; MONTE CARLO SIMULATORS; NORMAL FORM; TREE SEARCH; COMPUTER GO; MONTE-CARLO TREE SEARCHES; NORMAL FORM GAMES;

PLANT EXTRACTS; COMPUTER GAMES;

MONTE CARLO METHODS;

EID: 79955842500     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-20525-5_8     Document Type: Conference Paper

References (21)

1. Arneson, B., Hayward, R., Henderson, P.: Mohex wins hex tournament. ICGA Journal, 114-116 (2009)
2. Auer, P.: Using confidence bounds for exploitation-exploration trade-offs. The Journal of Machine Learning Research 3, 397-422 (2003)
3. Bourki, A., Chaslot, G., Coulm, M., Danjean, V., Doghmen, H., Hoock, J.-B., Hérault, T., Rimmel, A., Teytaud, F., Teytaud, O., Vayssière, P., Yu, Z.: Scalability and parallelization of monte-carlo tree search. In: Proceedings of Advances in Computer Games 13 (2010)
4. Bouzy, B., Cazenave, T.: Computer go: An AI oriented survey. Artificial Intelligence 132(1), 39-103 (2001)
5. Bruegmann, B.: Monte-carlo Go (1993) (unpublished draft), http://www.althofer.de/bruegmann-montecarlogo.pdf
6. Chandra, A.K., Kozen, D.C., Stockmeyer, L.J.: Alternation. J. ACM 28(1), 114-133 (1981)
7. Chaslot, G., Winands, M., Uiterwijk, J., van den Herik, H., Bouzy, B.: Progressive Strategies for Monte-Carlo Tree Search. In: Wang, P., et al. (eds.) Proceedings of the 10th Joint Conference on Information Sciences (JCIS 2007), pp. 655-661. World Scientific Publishing Co. Pte. Ltd., Singapore (2007)
8. Coulom, R.: Efficient Selectivity and Backup Operators in Monte-Carlo Tree Search. In: Ciancarini, P., van den Herik, H.J. (eds.) CG 2006. LNCS, vol. 4630, pp. 72-83. Springer, Heidelberg (2007)
9. de Mesmay, F., Rimmel, A., Voronenko, Y., Püschel, M.: Bandit-based optimization on graphs with application to library performance tuning. In: Danyluk, A.P., Bottou, L., Littman, M.L. (eds.) ICML. ACM International Conference Proceeding Series, vol. 382, p. 92. ACM, New York (2009)
10. Gelly, S., Silver, D.: Combining online and offline knowledge in UCT. In: ICML 2007: Proceedings of the 24th International Conference on Machine Learning, pp. 273-280. ACM Press, New York (2007)
11. Kocsis, L., Szepesvári, C.: Bandit based Monte-Carlo planning. In: Fürnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) ECML 2006. LNCS (LNAI), vol. 4212, pp. 282-293. Springer, Heidelberg (2006)
12. Lai, T., Robbins, H.: Asymptotically efficient adaptive allocation rules. Advances in Applied Mathematics 6, 4-22 (1985)
13. Lee, C.-S., Wang, M.-H., Chaslot, G., Hoock, J.-B., Rimmel, A., Teytaud, O., Tsai, S.-R., Hsu, S.-C., Hong, T.-P.: The Computational Intelligence of MoGo Revealed in Taiwan's Computer Go Tournaments. IEEE Transactions on Computational Intelligence and AI in games (2009)
14. Nakhost, H., Müller, M.: Monte-carlo exploration for deterministic planning. In: IJCAI, pp. 1766-1771 (2009)
15. Nethercote, N., Seward, J.: Valgrind: a framework for heavyweight dynamic binary instrumentation. SIGPLAN Not. 42(6), 89-100 (2007)
16. Robson, J.M.: The complexity of go. In: IFIP Congress, pp. 413-417 (1983)
17. Rolet, P., Sebag, M., Teytaud, O.: Optimal active learning through billiards and upper confidence trees in continous domains. In: Proceedings of the ECML Conference (2009)
18. Sharma, S., Kobti, Z., Goodwin, S.: Knowledge generation for improving simulations in UCT for general game playing. In: Wobcke, W., Zhang, M. (eds.) AI 2008. LNCS (LNAI), vol. 5360, pp. 49-55. Springer, Heidelberg (2008)
19. Teytaud, F., Teytaud, O.: Creating an Upper-Confidence-Tree program for Havannah. In: van den Herik, H.J., Spronck, P. (eds.) ACG 2009. LNCS, vol. 6048, pp. 65-74. Springer, Heidelberg (2010)
20. Teytaud, F., Teytaud, O.: On the huge benefit of decisive moves in monte-carlo tree search. In: Proceedings of the IEEE Conference on Computational Intelligence in Games (2010)
21. Wang, Y., Gelly, S.: Modifications of UCT and sequence-like simulations for Monte-Carlo Go. In: IEEE Symposium on Computational Intelligence and Games, Honolulu, Hawaii, pp. 175-182 (2007)