arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2501.07233cs.GT
收藏

组合博弈中引导蒙特卡洛树搜索的简化方法

Simplifications to Guide Monte Carlo Tree Search in Combinatorial Games

Michael Haythorpe, Alex Newcombe, Damian O'Dea

AI总结:

本研究针对组合博弈策略开发,提出通过分析简化策略与简化版博弈来改进蒙特卡洛树搜索(MCTS)、构建集成策略的方法,可作为高复杂度博弈的策略开发启发式手段。

摘要:

我们研究了一种用于组合博弈策略制定的改进型蒙特卡洛树搜索(MCTS)。这些改进通过分析简化策略和基础博弈的简化版本得出,再利用分析结果构建集成型策略。我们提出了若干可从简化结果预测算法相对性能的实例,使该方法可作为启发式策略,用于开发高复杂度博弈的策略,尤其适用于仿真类策略和对比分析基本难以实现的场景。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑