Simplifications to Guide Monte Carlo Tree Search in Combinatorial Games

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteurs principaux: Haythorpe, Michael, Newcombe, Alex, O'Dea, Damian
Format: Preprint
Publié: 2025
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866909455090712576
author Haythorpe, Michael
Newcombe, Alex
O'Dea, Damian
author_facet Haythorpe, Michael
Newcombe, Alex
O'Dea, Damian
contents We examine a type of modified Monte Carlo Tree Search (MCTS) for strategising in combinatorial games. The modifications are derived by analysing simplified strategies and simplified versions of the underlying game and then using the results to construct an ensemble-type strategy. We present some instances where relative algorithm performance can be predicted from the results in the simplifications, making the approach useful as a heuristic for developing strategies in highly complex games, especially when simulation-type strategies and comparative analyses are largely intractable.
format Preprint
id arxiv_https___arxiv_org_abs_2501_07233
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Simplifications to Guide Monte Carlo Tree Search in Combinatorial Games
Haythorpe, Michael
Newcombe, Alex
O'Dea, Damian
Computer Science and Game Theory
We examine a type of modified Monte Carlo Tree Search (MCTS) for strategising in combinatorial games. The modifications are derived by analysing simplified strategies and simplified versions of the underlying game and then using the results to construct an ensemble-type strategy. We present some instances where relative algorithm performance can be predicted from the results in the simplifications, making the approach useful as a heuristic for developing strategies in highly complex games, especially when simulation-type strategies and comparative analyses are largely intractable.
title Simplifications to Guide Monte Carlo Tree Search in Combinatorial Games
topic Computer Science and Game Theory
url https://arxiv.org/abs/2501.07233