Enhancements for Multi-Player Monte-Carlo Tree Search
Enhancements for Multi-Player Monte-Carlo Tree Search
复制标题
多人蒙特卡罗树搜索的增强功能
DOI：
--
复制
发表时间：
2010
期刊：
影响因子：
--
通讯作者：
A. Plaat
中科院分区：
文献类型：
--
作者：
J. A. M. Nijssen;M. Winands;H. J. Herik;H. Iida;A. Plaat
蒙特卡洛树搜索（MCT）在玩多玩家游戏中越来越受欢迎。在本文中，我们建议在多游戏游戏中为MCT提出两种增强功能：（1）渐进历史和（2）多人蒙特卡洛树搜索求解器（MP-MCTS-Solver）。我们在两个不同的多玩家游戏中分析了这些增强功能的性能：Focus和Chinese Checkers。基于实验结果，我们得出结论，使用标准更新规则，渐进历史在游戏和MP-MCT-Solver方面都有很大的改进，是重点的真正改进。
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.