Abstract
Monte Carlo Tree Search (MCTS) parallelization is one of the many possible enhancements for MCTS algorithms. However, no work has been done on evaluating these methods in the rather new area of General Video Game Playing (GVGP), an area that challenges the creation of agents that can play any videogame even without prior knowledge about the video game they are going to play. To address this gap, this paper proposes the implementation and evaluation of the three main MCTS parallelization methods as agents of the General Video Game AI framework, a popular framework for GVGP agents evaluation. This paper is not focused on comparing the parallel MCTS agents to other existing GVGP agents, but rather on exploring how the MCTS parallelization methods compare between themselves. This paper also presents a testing methodology for evaluating these agents, which is based on a set of three experiments focused on different aspects of the parallel MCTS algorithms. In these experiments, the overall best results were achieved by the root parallelization method using the sum merging technique and the UCT’s sigma value of \( \sqrt 2 \).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsNotes
- 1.
Implementations available at https://github.com/LCenteleghe/Parallel-MCTS-GVGP-Agents/.
- 2.
References
Browne, C.B., et al.: A survey of Monte Carlo tree search methods. IEEE Trans. Comput. Intell. AI Games [S.1.] 4(1), 1–43 (2012)
Campbell, M., Hoane, A.J., Hsu, F.: Deep blue. Artif. Intell. [S.l.] 134(1–2), 57–83 (2002)
Cazenave, T., Jouandeau, N.: A parallel Monte-Carlo tree search algorithm. In: van den Herik, H.J., Xu, X., Ma, Z., Winands, M.H.M. (eds.) CG 2008. LNCS, vol. 5131, pp. 72–80. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-87608-3_7
Chaslot, G., et al.: Monte-Carlo tree search: a new framework for game AI. In: Belgian/Netherlands Artificial Intelligence Conference [S.l.], pp. 389–390 (2008)
Chaslot, G.M.J.B., Winands, M.H.M., van den Herik, H.J.: Parallel Monte-Carlo tree search. In: van den Herik, H.J., Xu, X., Ma, Z., Winands, M.H.M. (eds.) CG 2008. LNCS, vol. 5131, pp. 60–71. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-87608-3_6
Coulom, R.: Efficient selectivity and backup operators in Monte-Carlo tree search. In: van den Herik, H.J., Ciancarini, P., Donkers, H.H.L.M. (eds.) CG 2006. LNCS, vol. 4630, pp. 72–83. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-75538-8_7
Karakovskiy, S., Togelius, J.: The Mario AI benchmark and competitions. IEEE Trans. Comput. Intell. AI Games [S.l.] 4(1), 55–67 (2012)
Levine, J., et al.: General video game playing. Artif. Comput. Intell. Games [S.l.] 6, 77–83 (2014)
Méhat, J., Cazenave, T.: A parallel general game player. KI - Künstliche Intelligenz [S.l.] 25(1), 43–47 (2011)
Mirsoleimani, S.A., et al.: Parallel Monte Carlo tree search from multi-core to many-core processors. In: Proceedings - 14th IEEE International Conference on Trust, Security and Privacy in Computing and Communications, TrustCom 2015 [S.l.], vol. 3, pp. 77–83 (2015)
Perez-Liebana, D., et al.: The 2014 general video game playing competition. IEEE Trans. Comput. Intell. AI Games [S.l.] 8(3), 229–243 (2016)
Perez-Liebana, D., et al.: General video game AI: a multi-track framework for evaluating agents, games and content generation algorithms [S.l.] (2018)
Rocki, K., Suda, R.: Parallel Monte Carlo tree search scalability discussion. In: Wang, D., Reynolds, M. (eds.) AI 2011. LNCS (LNAI), vol. 7106, pp. 452–461. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-25832-9_46
Świechowski, M., Mańdziuk, J.: A hybrid approach to parallelization of Monte Carlo tree search in general game playing. In: De Tré, G., Grzegorzewski, P., Kacprzyk, J., Owsiński, J.W., Penczek, W., Zadrożny, S. (eds.) Challenging Problems and Solutions in Intelligent Systems. SCI, vol. 634, pp. 199–215. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-30165-5_10
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Centeleghe, L.G.S., Fröhlich, W.R., Rigo, S.J. (2020). Parallel Monte Carlo Tree Search in General Video Game Playing. In: Cerri, R., Prati, R.C. (eds) Intelligent Systems. BRACIS 2020. Lecture Notes in Computer Science(), vol 12320. Springer, Cham. https://doi.org/10.1007/978-3-030-61380-8_42
Download citation
DOI: https://doi.org/10.1007/978-3-030-61380-8_42
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-61379-2
Online ISBN: 978-3-030-61380-8
eBook Packages: Computer ScienceComputer Science (R0)