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.
|Title of host publication||Computers and Games|
|Subtitle of host publication||7th International Conference, CG 2010, Kanazawa, Japan, September 24-26, 2010, Revised Selected Papers|
|Editors||H. Jaap van den Herik, Hiroyuki Iida, Aske Plaat|
|Place of Publication||Berlin, Heidelberg|
|Number of pages||12|
|Publication status||Published - 2011|
|Series||Lecture Notes in Computer Science|