Abstract
Monte-Carlo Tree Search (MCTS) is becoming increasingly popular for playing multi-player games. In this paper we propose two enhancements for MCTS in multi-player games: (1) Progressive History and (2) Multi-Player Monte-Carlo Tree Search Solver (MP-MCTS-Solver). We analyze the performance of these enhancements in two different multi-player games: Focus and Chinese Checkers. Based on the experimental results we conclude that Progressive History is a considerable improvement in both games and MP-MCTS-Solver, using the standard update rule, is a genuine improvement in Focus. © 2011 Springer-Verlag.
Cite
CITATION STYLE
Nijssen, J. A. M., & Winands, M. H. M. (2011). Enhancements for multi-player Monte-Carlo tree search. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6515 LNCS, pp. 238–249). https://doi.org/10.1007/978-3-642-17928-0_22
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
