Single-player Monte-Carlo tree search

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

Volumn 5131 LNCS, Issue , 2008, Pages 1-12

  Schadd, Maarten P D ^a   Winands, Mark H M ^a   Van Den Herik, H Jaap ^a   Chaslot, Guillaume M J B ^a   Uiterwijk, Jos W H M ^a  

^a MAASTRICHT UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

GAME THEORY;

CLASSICAL METHODS; EVALUATION FUNCTIONS; STANDARDIZED TESTS; TREE SEARCHES;

MONTE CARLO METHODS;

EID: 55249106680     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-87608-3_1     Document Type: Conference Paper

References (25)

1. Biedl, T.C., Demaine, E.D., Demaine, M.L., Fleischer, R., Jacobsen, L., Munro, I.: The Complexity of Clickomania. In: Nowakowski, R.J. (ed.) More Games of No Chance, Proc. MSRI Workshop on Combinatorial Games, pp. 389-404. MSRI Publ., Berkeley. Cambridge University Press, Cambridge (2002)
2. Billings, D.: Personal Communication. University of Alberta, Canada (2007)
3. Bouzy, B., Cazanave, T.: Computer Go: An AI-Oriented Survey. Artificial Intelligence 132(1), 39-103 (2001)
4. Bouzy, B., Helmstetter, B.: Monte-Carlo Go Developments. In: van den Herik, H.J., Iida, H., Heinz, E.A. (eds.) Proceedings of the 10th Advances in Computer Games Conference (ACG-10), The Netherlands, pp. 159-174. Kluwer Academic, Dordrecht (2003)
5. Brügmann, B.: Monte Carlo Go. Technical report, Physics Department, Syracuse University (1993)
6. Cazenave, T., Borsboom, J.: Golois Wins Phantom Go Tournament. ICGA Journal 30(3), 165-166 (2007)
7. Chaslot, G.M.J.-B., Winands, M.H.M., Uiterwijk, J.W.H.M., van den Herik, H.J., Bouzy, B.: Progressive strategies for Monte-Carlo Tree Search. New Mathematics and Natural Computation 4(3), 343-357 (2008)
8. Chaslot, G.M.J.B., de Jong, S., Saito, J.-T., Uiterwijk, J.W.H.M.: Monte-Carlo Tree Search in Production Management Problems. In: Schobbens, P.Y., Vanhoof, W., Schwanen, G. (eds.) Proceedings of the 18th BeNeLux Conference on Artificial Intelligence, Namur, Belgium, pp. 91-98 (2006)
9. Chaslot, G.M.J.B., Saito, J.-T., Bouzy, B., Uiterwijk, J.W.H.M., van den Herik, H.J.: Monte-Carlo Strategies for Computer Go. In: Schobbens, P.Y., Vanhoof, W., Schwanen, G. (eds.) Proceedings of the 18th BeNeLux Conference on Artificial Intelligence, Namur, Belgium, pp. 83-91 (2006)
10. Coulom, R.: Efficient selectivity and backup operators in Monte-Carlo tree search. In: van den Herik, H.J., Ciancarini, P., Donkers, H.H.L.M(J.) (eds.) CG 2006. LNCS, vol. 4630, pp. 72-83. Springer, Heidelberg (2007)
11. Culberson, J.C., Schaeffer, J.: Pattern databases. Computational Intelligence 14(3), 318-334 (1998)
12. Felner, A., Zahavi, U., Schaeffer, J., Holte, R.C.: Dual Lookups in Pattern Databases. In: IJCAI, Edinburgh, Scotland, pp. 103-108 (2005)
13. Gomes, C.P., Selman, B., McAloon, K., Tretkoff, C.: Randomization in Backtrack Search: Exploiting Heavy-Tailed Profiles for Solving Hard Scheduling Problems. In: AIPS, Pittsburg, PA, pp. 208-213 (1998)
14. Hart, P.E., Nilsson, N.J., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernatics 4(2), 100-107 (1968)
15. Junghanns, A.: Pushing the Limits: New Developments in Single Agent Search. PhD thesis, University of Alberta, Alberta, Canada (1999)
16. Kendall, G., Parkes, A., Spoerer, K.: A Survey of NP-Complete Puzzles. ICGA Journal 31(1), 13-34 (2008)
17. 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)
18. Kocsis, L., Szepesvári, C., Willemson, J.: Improved Monte-Carlo Search (2006), http://zaphod.aml.sztaki.hu/papers/cg06-ext.pdf
19. Korf, R.E.: Depth-first iterative deepening: An optimal admissable tree search. Artificial Intelligence 27(1), 97-109 (1985)
20. Moribe, K.: Chain shot! Gekkan ASCII, (November 1985) (in Japanese)
21. PDA Game Guide.com. Pocket PC Jawbreaker Game. The Ultimate Guide to PDA Games, Retrieved 7.1.2008 (2008), http://www.pdagameguide.com/jawbreaker-game. html
22. Sadikov, A., Bratko, I.: Solving 20 × 20 Puzzles. In: van den Herik, H.J., Uiterwijk, J.W.H.M., Winands, M.H.M., Schadd, M.P.D. (eds.) Proceedings of the Computer Games Workshop 2007 (CGW 2007), The Netherlands, pp. 157-164. Universiteit Maastricht, Maastricht (2007)
23. Tesauro, G., Galperin, G.R.: On-line policy improvement using Monte Carlo search. In: Mozer, M.C., Jordan, M.I., Petsche, T. (eds.) Advances in Neural Information Processing Systems, vol. 9, pp. 1068-1074. MIT Press, Cambridge (1997)
24. University of Alberta GAMES Group. GAMES Group News (Archives) (2002), http://www.cs.ualberta.ca/~games/archives.html
25. Vempaty, N.R., Kumar, V., Korf, R.E.: Depth-first versus best-first search. In: AAAI, Anaheim, California, USA, pp. 434-440. MIT Press, Cambridge (1991)