Enhancements for multi-player Monte-Carlo tree search

Authors:
J. A. M. Nijssen;Mark H. M. Winands
Affiliations:
Department of Knowledge Engineering, Faculty of Humanities and Sciences, Maastricht University, Maastricht, The Netherlands;Department of Knowledge Engineering, Faculty of Humanities and Sciences, Maastricht University, Maastricht, The Netherlands
Venue:
CG'10 Proceedings of the 7th international conference on Computers and games
Year:
2010

Citing 11
Cited 0

Introduction to Reinforcement Learning

Introduction to Reinforcement Learning
On Pruning Techniques for Multi-Player Games

Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Combining online and offline knowledge in UCT

Proceedings of the 24th international conference on Machine learning
Amazons Discover Monte-Carlo

CG '08 Proceedings of the 6th international conference on Computers and Games
Monte-Carlo Tree Search Solver

CG '08 Proceedings of the 6th international conference on Computers and Games
An Analysis of UCT in Multi-player Games

CG '08 Proceedings of the 6th international conference on Computers and Games
Multi-player Go

CG '08 Proceedings of the 6th international conference on Computers and Games
Efficient selectivity and backup operators in Monte-Carlo tree search

CG'06 Proceedings of the 5th international conference on Computers and games
Bandit based monte-carlo planning

ECML'06 Proceedings of the 17th European conference on Machine Learning
Evaluation function based monte-carlo LOA

ACG'09 Proceedings of the 12th international conference on Advances in Computer Games
The relative history heuristic

CG'04 Proceedings of the 4th international conference on Computers and Games

Quantified Score

Hi-index	0.00

Visualization

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.