Split Moves for Monte-Carlo Tree Search

by   Jakub Kowalski, et al.

In many games, moves consist of several decisions made by the player. These decisions can be viewed as separate moves, which is already a common practice in multi-action games for efficiency reasons. Such division of a player move into a sequence of simpler / lower level moves is called splitting. So far, split moves have been applied only in forementioned straightforward cases, and furthermore, there was almost no study revealing its impact on agents' playing strength. Taking the knowledge-free perspective, we aim to answer how to effectively use split moves within Monte-Carlo Tree Search (MCTS) and what is the practical impact of split design on agents' strength. This paper proposes a generalization of MCTS that works with arbitrarily split moves. We design several variations of the algorithm and try to measure the impact of split moves separately on efficiency, quality of MCTS, simulations, and action-based heuristics. The tests are carried out on a set of board games and performed using the Regular Boardgames General Game Playing formalism, where split strategies of different granularity can be automatically derived based on an abstract description of the game. The results give an overview of the behavior of agents using split design in different ways. We conclude that split design can be greatly beneficial for single- as well as multi-action games.



There are no comments yet.


page 6

page 22

page 24

page 25


Monte Carlo Game Solver

We present a general algorithm to order moves so as to speedup exact gam...

A Novel Approach to Solving Goal-Achieving Problems for Board Games

Goal-achieving problems are puzzles that set up a specific situation wit...

Biasing MCTS with Features for General Games

This paper proposes using a linear function approximator, rather than a ...

Identifying Playerś Strategies in No Limit Texas Holdém Poker through the Analysis of Individual Moves

The development of competitive artificial Poker playing agents has prove...

Cops and Robbers on Toroidal Chess Graphs

We investigate multiple variants of the game Cops and Robbers. Playing i...

On Move Pattern Trends in a Large Go Games Corpus

We process a large corpus of game records of the board game of Go and pr...

Learning to Win by Reading Manuals in a Monte-Carlo Framework

Domain knowledge is crucial for effective performance in autonomous cont...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.