Enhancements for Multi-Player Monte-Carlo Tree Search

J. A. M. Nijssen, Mark H. M. Winands

Research output: Chapter in Book/Report/Conference proceedingChapterAcademic

14 Citations (Scopus)

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.
Original languageEnglish
Title of host publicationComputers and Games
Subtitle of host publication7th International Conference, CG 2010, Kanazawa, Japan, September 24-26, 2010, Revised Selected Papers
EditorsH. Jaap van den Herik, Hiroyuki Iida, Aske Plaat
Place of PublicationBerlin, Heidelberg
PublisherSpringer
Pages238-249
Number of pages12
ISBN (Print)978-3-642-17928-0
DOIs
Publication statusPublished - 2011

Publication series

SeriesLecture Notes in Computer Science
Volume6515

Cite this

Nijssen, J. A. M., & Winands, M. H. M. (2011). Enhancements for Multi-Player Monte-Carlo Tree Search. In H. J. van den Herik, H. Iida, & A. Plaat (Eds.), Computers and Games: 7th International Conference, CG 2010, Kanazawa, Japan, September 24-26, 2010, Revised Selected Papers (pp. 238-249). Springer. Lecture Notes in Computer Science, Vol.. 6515 https://doi.org/10.1007/978-3-642-17928-0_22