Monte Carlo tree search in lines of action

IEEE Transactions on Computational Intelligence and AI in Games

Volumn 2, Issue 4, 2010, Pages 239-250

  Winands, Mark H M ^a   Björnsson, Yngvi ^b   Saito, Jahn Takeshi ^a  

^a MAASTRICHT UNIVERSITY   (Netherlands)

^b REYKJAVIK UNIVERSITY   (Iceland)

Author keywords

Game tree solver; Lines of Action (LOA); Monte Carlo tree search (MCTS)

Indexed keywords

BRANCHING FACTORS; DOMAIN KNOWLEDGE; EVALUATION FUNCTION; GAME-TREE SOLVER; IN-LINE; LINES OF ACTION; MONTE CARLO; MONTE CARLO SIMULATION; SEARCH TREES; THEORETICAL VALUES; TREE SEARCH;

COMPUTER SIMULATION; GAME THEORY;

MONTE CARLO METHODS;

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

References (54)

1. R. Coulom, "Efficient selectivity and backup operators in Monte-Carlo tree search," in Computers and Games (CG 2006), ser. Lecture Notes in Computer Science, H. J. van den Herik, P. Ciancarini, and H. H. L. M. Donkers, Eds. Heidelberg, Germany: Springer-Verlag, 2007, vol. 4630, pp. 72-83.
2. L. Kocsis and C. Szepesvári, "Bandit based Monte-Carlo planning," in Machine Learning: ECML 2006, ser. Lecture Notes in Artificial Intelligence, J. Fürnkranz, T. Scheffer, and M. Spiliopoulou, Eds. Berlin, Germany: Springer-Verlag, 2006, vol. 4212, pp. 282-293.
3. B. Abramson, "Expected-outcome: A general model of static evaluation," IEEE Trans. Pattern Anal. Mach. Intell., vol. 12, no. 2, pp. 182-193, Feb. 1990.
4. B. Bouzy and B. Helmstetter, "Monte-Carlo Go Developments," in Advances in Computer Games 10: Many Games, Many Challenges, H. J. van den Herik, H. Iida, and E. A. Heinz, Eds. Boston, MA: Kluwer, 2003, pp. 159-174.
5. B. Brügmann, "Monte Carlo Go," Phys. Dept., Syracuse Univ., Syracuse, NY, Tech. Rep., 1993.
6. B. Sheppard, "World-championship-caliber scrabble," Artif. Intell., vol. 134, no. 1-2, pp. 241-275, 2002.
7. M. Buro, J. R. Long, T. Furtak, and N. R. Sturtevant, "Improving state evaluation, inference, and search in trick-based card games," in Proc. 21st Int. Joint Conf. Artif. Intell., C. Boutilier, Ed., Pasadena, CA, 2009, pp. 1407-1413.
8. H. Finnsson and Y. Björnsson, "Simulation-based approach to general game playing," in Proc. 23rd AAAI Conf. Artif. Intell., D. Fox and C. Gomes, Eds., 2008, pp. 259-264.
9. T. Cazenave and J. Borsboom, "Golois wins phantom go tournament," Int. Comput. Games Assoc. J., vol. 30, no. 3, pp. 165-166, 2007.
10. T. Cazenave and A. Saffidine, "Utilisation de la recherche arborescente Monte-Carlo au Hex," (in French) Revue d'Intelligence Artificielle, vol. 23, no. 2-3, pp. 183-202, 2009.
11. R. Lorentz, "Amazons discover Monte-Carlo," in Computers and Games (CG 2008), ser. Lecture Notes in Computer Science, H. J. van den Herik, X. Xu, Z. Ma, and M. H. M. Winands, Eds. Berlin, Germany: Springer-Verlag, 2008, vol. 5131, pp. 13-24.
12. H. Finnsson and Y. Björnsson, "Simulation control in general game playing agents," in Proc. IJCAI Workshop General Game Playing, Jul. 2009, pp. 21-26.
13. S. Sackson, A Gamut of Games. New York: Random House, 1969.
14. M. H. M.Winands, "Informed search in complex games," Ph.D. dissertation, Dept. Comput. Sci., Maastricht Univ., Maastricht, The Netherlands, 2004.
15. B. Helmstetter and T. Cazenave, "Architecture d'un programme de Lines of Action," in Intelligence Artificielle et Jeux (in French), T. Cazenave, Ed. Lavoisier, France: Hermes Science, 2006, pp. 117-126.
16. D. Billings and Y. Björnsson, "Search and knowledge in Lines of Action," in Advances in Computer Games 10: Many Games, Many Challenges, H. J. van den Herik, H. Iida, and E. A. Heinz, Eds. Boston, MA: Kluwer, 2003, pp. 231-248.
17. M. H. M. Winands, Y. Björnsson, and J.-T. Saito, "Monte-Carlo Tree Search Solver," in Computers and Games (CG 2008), ser. Lecture Notes in Computer Science, H. J. van den Herik, X. Xu, Z. Ma, and M. H. M. Winands, Eds. Berlin, Germany: Springer-Verlag, 2008, vol. 5131, pp. 25-36.
18. M. H. M. Winands and Y. Björnsson, "Evaluation function based Monte-Carlo LOA," in Advances in Computer Games Conference (ACG 2009), ser. Lecture Notes in Computer Science, H. J. van den Herik and P. Spronck, Eds. Berlin, Germany: Springer-Verlag, 2010, vol. 6048, pp. 33-44.
19. M. H. M. Winands, J. W. H. M. Uiterwijk, and H. J. van den Herik, "The quad heuristic in lines of action," Int. Comput. Games Assoc. J., vol. 24, no. 1, pp. 3-15, 2001.
20. L. V. Allis, H. J. van den Herik, and I. S. Herschberg, "Which games will survive?," in Heuristic Programming in Artificial Intelligence 2: The Second Computer Olympiad, D. N. L. Levy and D. F. Beal, Eds. Chichester, U.K.: Ellis Horwood, 1991, pp. 232-243.
21. M. H. M.Winands, "6×6 LOA is solved," Int. Comput. Games Assoc. J., vol. 31, no. 3, pp. 234-238, 2008.
22. M. H. M. Winands, "Analysis and implementation of Lines of Action," M.S. thesis, Dept. Comput. Sci., Maastricht Univ., Maastricht, The Netherlands, 2000.
23. D. M. Breuker, J. W. H. M. Uiterwijk, and H. J. van den Herik, "Replacement schemes and two-level tables," Int. Comput. Chess Assoc. J., vol. 19, no. 3, pp. 175-180, 1996.
24. J. Schaeffer and A. Plaat, "New advances in alpha-beta searching," in Proc. ACM 24th Annu. Conf. Comput. Sci., New York, 1996, pp. 124-130.
25. S. Akl and M. Newborn, "The principal continuation and the killer heuristic," in Proc. ACM Annu. Conf. Proc., New York, 1977, pp. 466-473.
26. C. Donninger, "Null move and deep search: Selective-search heuristics for obtuse chess programs," Int. Comput. Chess Assoc. J., vol. 16, no. 3, pp. 137-143, 1993.
27. E. A. Heinz, "Adaptive null-move pruning," Int. Comput. Chess Assoc. J., vol. 22, no. 3, pp. 123-132, 1999.
28. Y. Björnsson and T. A. Marsland, "Risk management in game-tree pruning," Inf. Sci., vol. 122, no. 1, pp. 23-41, 2001.
29. M. H. M. Winands, H. J. van den Herik, J. W. H. M. Uiterwijk, and E. C. D. van derWerf, "Enhanced forward pruning," Inf. Sci., vol. 175, no. 4, pp. 315-329, 2005.
30. D. Dyer, Lines of Action Homepage, 2000 [Online]. Available: http:// www.andromeda.com/people/ddyer/loa/loa.html
31. D. Eppstein, "Dynamic connectivity in digital images," Inf. Process. Lett., vol. 62, no. 3, pp. 121-126, May 1997.
32. L. Kocsis, J. W. H. M. Uiterwijk, and H. J. van den Herik, "Learning time allocation using neural networks," in Computers and Games (CG 2000), ser. Lecture Notes in Computer Science, T. A. Marsland and I. Frank, Eds. Berlin, Germany: Springer-Verlag, 2001, vol. 2063, pp. 170-185.
33. L. Kocsis, J. Uiterwijk, and H. van den Herik, "Move ordering using neural networks," in Engineering of Intelligent Systems, ser. Lecture Notes in Artificial Intelligence, L. Montosori, J. Váncza, and M. Ali, Eds. Berlin, Germany: Springer-Verlag, 2001, vol. 2070, pp. 45-50.
34. Y. Björnsson, "Selective depth-first game-tree search," Ph.D. dissertation, Dept. Comput. Sci., Univ. Alberta, Edmonton, AB, Canada, 2002.
35. H. H. L. M. Donkers, J. W. H. M. Uiterwijk, and H. J. van den Herik, "Admissibility in opponent-model search," Inf. Sci., vol. 154, no. 3-4, pp. 119-140, 2003.
36. M. Sakuta, T. Hashimoto, J. Nagashima, J. W. H. M. Uiterwijk, and H. Iida, "Application of the killer-tree heuristic and the lamba-search method to lines of action," Inf. Sci., vol. 154, no. 3-4, pp. 141-155, 2003.
37. T. Hashimoto, J. Nagashima, M. Sakuta, J. W. H. M. Uiterwijk, and H. Iida, "Automatic realization-probability search," Dept. Comput. Sci., Univ. Shizuoka, Hamamatsu, Japan, Internal Rep., 2003.
38. Lines of ActionWikipage [Online]. Available: http://en.wikipedia.org/ wiki/Lines of Action
39. G. M. J.-B. Chaslot, M. H. M. Winands, J. W. H. M. Uiterwijk, H. J. van den Herik, and B. Bouzy, "Progressive strategies for Monte-Carlo tree search," New Math. Natural Comput., vol. 4, no. 3, pp. 343-357, 2008.
40. Y. Tsuruoka, D. Yokoyama, and T. Chikayama, "Game-tree search algorithm based on realization probability," Int. Comput. Games Assoc. J., vol. 25, no. 3, pp. 132-144, 2002.
41. J. A. M. Nijssen and M. H. M. Winands, "Enhancements for multiplayer Monte-Carlo tree search," in Computer and Games (CG 2010), H. J. van den Herik, H. Iida, and A. Plaat, Eds., 2010.
42. M. H. M.Winands and Y. Björnsson, "Enhanced realization probability search," New Math. Natural Comput., vol. 4, no. 3, pp. 329-342, 2008.
43. S. Gelly and D. Silver, "Combining online and offline knowledge in UCT," in Proc. Int. Conf. Mach. Learn., Z. Ghahramani, Ed., 2007, pp. 273-280.
44. T. Cazenave and N. Jouandeau, "On the parallelization of UCT," in Proc. Comput. Games Workshop, H. J. van den Herik, J. W. H. M. Uiterwijk, M. H. M. Winands, and M. P. D. Schadd, Eds., Maastricht, The Netherlands, 2007, pp. 93-101.
45. G. M. J.-B. Chaslot, M. H. M.Winands, and H. J. van den Herik, "Parallel Monte-Carlo tree search," in Computers and Games (CG 2008), ser. Lecture Notes in Computer Science, H. J. van den Herik, X. Xu, Z. Ma, and M. H. M.Winands, Eds. Berlin, Germany: Springer-Verlag, 2008, vol. 5131, pp. 60-71.
46. S. Gelly, J.-B. Hoock, A. Rimmel, O. Teytaud, and Y. Kalemkarian, "The parallelization of Monte-Carlo planning-Parallelization of MCplanning," in Proc. 5th Int. Conf. Inf. Control Autom. Robot. Intell. Control Syst. Optim., J. Filipe, J. Andrade-Cetto, and J.-L. Ferrier, Eds., 2008, pp. 244-249.
47. M. Enzenberger and M. Müller, "A lock-free multithreaded Monte-Carlo tree search algorithm," in Advances in Computer Games (ACG 2009), ser. Lecture Notes in Computer Science, H. J. van den Herik and P. H. M. Spronck, Eds. Berlin, Germany: Springer-Verlag, 2010, vol. 6048, pp. 14-20.
48. P. Zhang and K. Chen, "Monte-Carlo Go tactic search," in Proc. 10th Joint Conf. Inf. Sci., P.Y. Cao, H. Cheng, D. Hung, C. Kahraman, C.W. Ngo, Y. Ohsawa, M.G. Romay, M.C. Su, A. Vasilakos, D. Wang, and P.P. Wang , Eds., 2007, pp. 662-670.
49. J. Kloetzer, H. Iida, and B. Bouzy, "A comparative study of solvers in Amazons endgames," in Proc. Comput. Intell. Games, 2008, pp. 378-384.
50. B. Bouzy, "Old-fashioned computer go vs Monte-Carlo go," in Proc. IEEE Symp. Comput. Intell. Games, 2007, invited tutorial.
51. M. H. M. Winands and H. J. van den Herik, "MIA: A world champion LOA program," in Proc. 11th Game ProgrammingWorkshop, 2006, pp. 84-91.
52. M. H. M. Winands, E. C. D. van der Werf, H. J. van den Herik, and J. W. H. M. Uiterwijk, "The relative history heuristic," in Computers and Games (CG 2004), ser. Lecture Notes in Computer Science, H. J. van den Herik, Y. Björnsson, and N. S. Netanyahu, Eds. Berlin, Germany: Springer-Verlag, 2006, vol. 3846, pp. 262-272.
53. L. V. Allis, "Searching for solutions in games and artificial intelligence," Ph.D. dissertation, Rijksuniversiteit Limburg, Maastricht, The Netherlands, 1994.
54. J. Steinhauer, "Monte-Carlo TwixT," MS. thesis, Dept. Knowl. Eng., Maastricht Univ., Maastricht, The Netherlands, 2010.