αβ-based play-outs in Monte-Carlo tree search

2011 IEEE Conference on Computational Intelligence and Games, CIG 2011

Volumn , Issue , 2011, Pages 110-117

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

^a MAASTRICHT UNIVERSITY   (Netherlands)

^b REYKJAVIK UNIVERSITY   (Iceland)

Author keywords

[No Author keywords available]

Indexed keywords

BEST STRATEGY; EXTRA COMPUTATIONS; LINES OF ACTION; MONTE CARLO; SIMULATION-BASED; TIME UNITS; TREE SEARCH;

ARTIFICIAL INTELLIGENCE;

PLANT EXTRACTS;

EID: 80054021514     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CIG.2011.6031996     Document Type: Conference Paper

References (40)

1. D. E. Knuth and R. W. Moore, "An analysis of alpha-beta pruning," Artificial Intelligence, vol. 6, no. 4, pp. 293-326, 1975.
2. F. Hsu, Behind Deep Blue: Building the Computer that Defeated the World Chess Champion. Princeton, NJ, USA: Princeton University Press, 2002.
3. J. Schaeffer, One Jump Ahead: Computer Perfection at Checkers, 2nd ed. New York, NY, USA: Springer, 2009.
4. T. A. Marsland and Y. Björnsson, "Variable-depth search," in Advances in Computer Games 9, H. J. van den Herik and B. Monien, Eds. Universiteit Maastricht, Maastricht, The Netherlands, 2001, pp. 9-24.
5. H. J. Berliner, G. Goetsch, M. S. Campbell, and C. Ebeling, "Measuring the performance potential of chess programs," Artificial Intelligence, vol. 43, no. 1, pp. 7-20, 1990. (Pubitemid 20717232)
6. A. Junghanns and J. Schaeffer, "Search versus knowledge in gameplaying programs revisited," in IJCAI-97, 1997, pp. 692-697.
7. M. Müller, "Computer Go," Artificial Intelligence, vol. 134, no. 1-2, pp. 145-179, 2002. (Pubitemid 34086582)
8. R. Coulom, "Efficient selectivity and backup operators in Monte-Carlo tree search," in Computers and Games (CG 2006), ser. Lecture Notes in Computer Science (LNCS), H. J. van den Herik, P. Ciancarini, and H. H. L. M. Donkers, Eds., vol. 4630. Berlin Heidelberg, Germany: Springer-Verlag, 2007, pp. 72-83.
9. 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., vol. 4212, 2006, pp. 282-293. (Pubitemid 44618839)
10. B. Abramson, "Expected-outcome: A general model of static evaluation," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 12, no. 2, pp. 182-193, 1990. (Pubitemid 20666142)
11. 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. Kluwer Academic Publishers, Boston, MA, USA, 2003, pp. 159-174.
12. B. Brügmann, "Monte Carlo Go," Physics Department, Syracuse University, Tech. Rep., 1993.
13. H. Finnsson and Y. Björnsson, "Simulation-based approach to General Game Playing," in Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, AAAI 2008, D. Fox and C. Gomes, Eds. AAAI Press, 2008, pp. 259-264.
14. R. J. Lorentz, "Amazons discover Monte-Carlo," in Computers and Games (CG 2008), ser. Lecture Notes in Computer Science (LNCS), H. J. van den Herik, X. Xu, Z. Ma, and M. H. M. Winands, Eds., vol. 5131. Berlin Heidelberg, Germany: Springer, 2008, pp. 13-24.
15. B. Arneson, R. B. Hayward, and P. Henderson, "Monte Carlo Tree Search in Hex," IEEE Transactions on Computational Intelligence and AI in Games, vol. 2, no. 4, pp. 251-258, 2010.
16. S. Gelly and D. Silver, "Combining online and offline knowledge in UCT," in Proceedings of the International Conference on Machine Learning (ICML), Z. Ghahramani, Ed. ACM, 2007, pp. 273-280.
17. K.-H. Chen and P. Zhang, "Monte-Carlo Go with knowledge-guided simulations," ICGA Journal, vol. 31, no. 2, pp. 67-76, 2008.
18. M. H. M. Winands, Y. Björnsson, and J.-T. Saito, "Monte Carlo Tree Search in Lines of Action," IEEE Transactions on Computational Intelligence and AI in Games, vol. 2, no. 4, pp. 239-250, 2010.
19. 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 (LNCS), H. J. van den Herik, X. Xu, Z. Ma, and M. H. M. Winands, Eds., vol. 5131. Berlin Heidelberg, Germany: Springer, 2008, pp. 25-36.
20. 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 (LNCS), H. J. van den Herik and P. Spronck, Eds., vol. 6048. Berlin Heidelberg, Germany: Springer, 2010, pp. 33-44.
21. S. Sackson, A Gamut of Games. Random House, New York, NY, USA, 1969.
22. 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. Kluwer Academic Publishers, Boston, MA, USA, 2003, pp. 231-248.
23. 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 Mathematics and Natural Computation, vol. 4, no. 3, pp. 343-357, 2008.
24. P. Zhang and K.-H. Chen, "Monte Carlo Go capturing tactic search," New Mathematics and Natural Computation, vol. 4, no. 3, pp. 359- 367, 2008.
25. J. Kloetzer, H. Iida, and B. Bouzy, "A comparative study of solvers in Amazons endgames," in Computational Intelligence and Games (CIG 2008). IEEE, 2008, pp. 378-384.
26. Y. Tsuruoka, D. Yokoyama, and T. Chikayama, "Game-tree search algorithm based on realization probability," ICGA Journal, vol. 25, no. 3, pp. 132-144, 2002.
27. J. A. M. Nijssen and M. H. M. Winands, "Enhancements for multiplayer Monte-Carlo Tree Search," in Computers and Games (CG 2010), ser. Lecture Notes in Computer Science (LNCS), H. J. van den Herik, H. Iida, and A. Plaat, Eds., vol. 6151. Berlin Heidelberg, Germany: Springer, 2011, pp. 238-249.
28. M. H. M.Winands and Y. Björnsson, "Enhanced realization probability search," New Mathematics and Natural Computation, vol. 4, no. 3, pp. 329-342, 2008.
29. M. H. M. Winands and H. J. van den Herik, "MIA: A world champion LOA program," in The 11th Game Programming Workshop in Japan (GPW 2006), 2006, pp. 84-91.
30. G. M. J.-B. Chaslot, "Monte-carlo tree search," Ph.D. dissertation, Maastricht University, Maastricht, The Netherlands, 2010.
31. R. J. Lorentz, "Improving monte-carlo tree search in Havannah," in Computers and Games (CG 2010), ser. Lecture Notes in Computer Science (LNCS), H. J. van den Herik, H. Iida, and A. Plaat, Eds., vol. 6151. Berlin Heidelberg, Germany: Springer, 2011, pp. 105-115.
32. T. A. Marsland, "A review of game-tree pruning," ICCA Journal, vol. 9, no. 1, pp. 3-19, 1986.
33. S. Akl and M. Newborn, "The principal continuation and the killer heuristic," in 1977 ACM Annual Conference Proceedings. ACM Press, New York, NY, USA, 1977, pp. 466-473.
34. D. M. Breuker, J. W. H. M. Uiterwijk, and H. J. van den Herik, "Replacement schemes and two-level tables," ICCA Journal, vol. 19, no. 3, pp. 175-180, 1996.
35. J. Schaeffer and A. Plaat, "New advances in alpha-beta searching," in Proceedings of the 1996 ACM 24th Annual Conference on Computer Science. ACM Press, New York, NY, USA, 1996, pp. 124-130.
36. C. Donninger, "Null move and deep search: Selective-search heuristics for obtuse chess programs," ICCA Journal, vol. 16, no. 3, pp. 137-143, 1993.
37. E. A. Heinz, "Adaptive null-move pruning," ICCA Journal, vol. 22, no. 3, pp. 123-132, 1999.
38. Y. Björnsson and T. A. Marsland, "Risk managament in game-tree pruning," Information Sciences, vol. 122, no. 1, pp. 23-41, 2001.
39. M. H. M. Winands, H. J. van den Herik, J. W. H. M. Uiterwijk, and E. C. D. van der Werf, "Enhanced forward pruning," Information Sciences, vol. 175, no. 4, pp. 315-329, 2005. (Pubitemid 41312980)
40. 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 (LNCS), H. J. van den Herik, Y. Björnsson, and N. S. Netanyahu, Eds., vol. 3846. Berlin, Germany: Springer-Verlag, 2006, pp. 262- 272. (Pubitemid 43904289)