Abstract
The UCT (Upper Confidence Bounds applied to Trees) algorithm has allowed for significant improvements in a number of games, most notably the game of Go. Move groups is a modification that greatly reduces the branching factor at the cost of increased search depth and as such may be used to enhance the performance of UCT. From the results of the experiments, we arrive at the general structure of good move groups and the parameters to use for enhancing the playing strength.
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
Preview
Unable to display preview. Download preview PDF.
References
Audibert, J.-Y., Bubeck, S., Munos, R.: Best Arm Identification in Multi-Armed Bandits. In: COLT 2010, pp. 41–53 (2010)
Auer, P., Cesa-Bianchi, N., Fischer, P.: Finite-time Analysis of the Multiarmed Bandit Problem. In: Machine Learning, pp. 235–256 (2002)
Chaslot, G.M.J.-B., Winands, M.H.M., van den Herik, H.J., Uiterwijk, J.W.H.M., Bouzy, B.: Progressive Strategies for Monte-Carlo Tree Search. New Mathematics and Natural Computation (NMNC) 4, 343–357 (2008)
Childs, B.E., Brodeur, J.H., Kocsis, L.: Transpositions and Move Groups in Monte Carlo Tree Search. In: Hingston, P., Barone, L. (eds.) IEEE Symposium on Computational Intelligence and Games, pp. 389–395. IEEE (December 2008)
Gelly, S., Silver, D.: Monte-Carlo Tree Search and Rapid Action Value Estimation in Computer Go. Artificial Intelligence 175, 1856–1875 (2011)
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)
Lorentz, R.J.: Amazons Discover Monte-Carlo. In: van den Herik, H.J., Xu, X., Ma, Z., Winands, M.H.M. (eds.) CG 2008. LNCS, vol. 5131, pp. 13–24. Springer, Heidelberg (2008)
Müller, M.: Fuego at the Computer Olympiad in Pamplona 2009: a Tournament Report. Technical report, University of Alberta, Dept. of Computing Science, TR09-09 (May 2009)
Saito, J.-T., Winands, M.H.M., Uiterwijk, J.W.H.M., van den Herik, H.J.: Grouping Nodes for Monte-Carlo Tree Search. In: Computer Games Workshop 2007, pp. 276–283 (2007)
Wang, Y., Gelly, S.: Modifications of UCT and Sequence-Like Simulations for Monte-Carlo Go. In: IEEE Symposium on Computational Intelligence and Games, pp. 175–182. IEEE (April 2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Van Eyck, G., Müller, M. (2012). Revisiting Move Groups in Monte-Carlo Tree Search. In: van den Herik, H.J., Plaat, A. (eds) Advances in Computer Games. ACG 2011. Lecture Notes in Computer Science, vol 7168. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31866-5_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-31866-5_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31865-8
Online ISBN: 978-3-642-31866-5
eBook Packages: Computer ScienceComputer Science (R0)