Abstract
In Monte-Carlo Tree Search, simulations play a crucial role since they replace the evaluation function used in classical game-tree search and guide the development of the game tree. Despite their importance, not too much is known about the details of how they work. This paper starts a more in-depth study of simulations, using the game of Go, and in particular the program Fuego, as an example. Playout policies are investigated in terms of the number of blunders they make, and in terms of how many points they lose over the course of a simulation. The result is a deeper understanding of the different components of the Fuego playout policy, as well as an analysis of the shortcomings of current methods for evaluating playouts.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Arneson, B., Hayward, R., Henderson, P.: Solving hex: beyond humans. In: van den Herik, H.J., et al. [13], pp. 1–10 (2011)
Ben-Or, M., Hassidim, A.: The Bayesian learner is optimal for noisy binary search (and pretty good for quantum as well). In: FOCS, pp. 221–230. IEEE, Washington, DC (2008)
Dailey, D.: Computer Go Server (2007–2013). http://cgos.boardspace.net. Accessed 10 April 2013
Enzenberger, M.: GoGui (2007–2013). http://gogui.sourceforge.net. Accessed 10 April 2013
Enzenberger, M., Müller, M.: Fuego homepage (2008–2013). http://fuego.sf.net. Accessed 10 April 2013
Enzenberger, M., Müller, M., Arneson, B., Segal, R.: Fuego - an open-source framework for board games and Go engine based on Monte Carlo tree search. IEEE Trans. Comput. Intell. AI Games 2(4), 259–270 (2010)
Gelly, S., Silver, D.: Combining online and offline knowledge in UCT. In: ICML ’07: Proceedings of the 24th International Conference on Machine Learning, pp. 273–280. ACM (2007)
Huang, S., Coulom, R., Lin, S.: Monte-Carlo simulation balancing in practice. In: van den Herik, H.J., et al. [13], pp. 81–92 (2011)
Karp, R.M., Kleinberg, R.: Noisy binary search and its applications. In: SODA, pp. 881–890. SIAM, Philadelphia, PA, USA (2007)
Müller, M.: Decomposition search: a combinatorial games approach to game tree search, with applications to solving Go endgames. In: IJCAI, pp. 578–583, Stockholm, Sweden (1999)
Nowak, R.: Generalized binary search. In: Proceedings of the 46th Allerton Conference on Communications, Control, and Computing, pp. 568–574 (2008)
Silver, D., Tesauro, G.: Monte-Carlo simulation balancing. In: Danyluk, A., Bottou, L., Littman, M. (eds.) ICML, vol. 382, pp. 945–952. ACM (2009)
van den Herik, H.J., Iida, H., Plaat, A. (eds.): CG 2010. LNCS, vol. 6515. Springer, Heidelberg (2011)
Acknowledgements
Support for this research was provided by NSERC, and the Departments of Electrical and Computer Engineering and of Computing Science at University of Alberta.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Fernando, S., Müller, M. (2014). Analyzing Simulations in Monte-Carlo Tree Search for the Game of Go. In: van den Herik, H., Iida, H., Plaat, A. (eds) Computers and Games. CG 2013. Lecture Notes in Computer Science(), vol 8427. Springer, Cham. https://doi.org/10.1007/978-3-319-09165-5_7
Download citation
DOI: https://doi.org/10.1007/978-3-319-09165-5_7
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-09164-8
Online ISBN: 978-3-319-09165-5
eBook Packages: Computer ScienceComputer Science (R0)