Abstract
Monte-Carlo Tree Search is a powerful paradigm for the game of Go. In this contribution we present a parallel Master-Slave algorithm for Monte-Carlo Tree Search and test it on a network of computers using various configurations: from 12,500 to 100,000 playouts, from 1 to 64 slaves, and from 1 to 16 computers. On our own architecture we obtain a speedup of 14 for 16 slaves. With a single slave and five seconds per move our algorithm scores 40.5% against GNU Go, with sixteen slaves and five seconds per move it scores 70.5%. At the end we give the potential speedups of our algorithm for various playout times.
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
Brügmann, B.: Monte Carlo Go. Technical report, Physics Department, Syracuse University (1993)
Campbell, M., Hoane Jr., A.J., Hsu, F.-h.: Deep Blue. Artifial Intelligence 134(1-2), 57–83 (2002)
Cazenave, T., Jouandeau, N.: On the parallelization of UCT. In: Computer Games Workshop 2007, Amsterdam, The Netherlands, June 2007, pp. 93–101 (2007)
Coulom, R.: Efficient selectivity and back-up operators in Monte-Carlo tree search. In: CG 2006. LNCS, vol. 4630, pp. 72–83. Springer, Heidelberg (2006)
Gabriel, E., Fagg, G.E., Bosilca, G., Angskun, T., Dongarra, J.J., Squyres, J.M., Sahay, V., Kambadur, P., Barrett, B., Lumsdaine, A., Castain, R.H., Daniel, D.J., Graham, R.L., Woodall, T.S.: Open MPI: Goals, concept, and design of a next generation MPI implementation. In: Proceedings, 11th European PVM/MPI Users’ Group Meeting, Budapest, Hungary, pp. 97–104 (September 2004)
Gelly, S., Silver, D.: Combining online and offline knowledge in UCT. In: ICML, pp. 273–280 (2007)
Gelly, S., Wang, Y., Munos, R., Teytaud, O.: Modification of UCT with patterns in Monte-Carlo Go. Technical Report 6062, INRIA (2006)
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)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cazenave, T., Jouandeau, N. (2008). A Parallel Monte-Carlo Tree Search Algorithm. In: van den Herik, H.J., Xu, X., Ma, Z., Winands, M.H.M. (eds) Computers and Games. CG 2008. Lecture Notes in Computer Science, vol 5131. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87608-3_7
Download citation
DOI: https://doi.org/10.1007/978-3-540-87608-3_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-87607-6
Online ISBN: 978-3-540-87608-3
eBook Packages: Computer ScienceComputer Science (R0)