An Efficient Optimization of the Monte Carlo Tree Search Algorithm for Amazons

Amazons is a computerized board game with complex positions that are highly challenging for humans. In this paper, we propose an efficient optimization of the Monte Carlo tree search (MCTS) algorithm for Amazons, fusing the ‘Move Groups’ strategy and the ‘Parallel Evaluation’ optimization strategy (...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Algorithms Ročník 17; číslo 8; s. 334
Hlavní autori: Zhang, Lijun, Zou, Han, Zhu, Yungang
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Basel MDPI AG 01.08.2024
Predmet:
algorithm optimization
Algorithms
Amazons
Board games
Computer & video games
Efficiency
Game theory
Games
Historical analysis
Mathematical optimization
Monte Carlo method
Monte Carlo simulation
Move Groups
Optimization
Parallel Evaluation
Performance evaluation
Search algorithms
Search theory
Strategy
China
ISSN:1999-4893, 1999-4893
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:Amazons is a computerized board game with complex positions that are highly challenging for humans. In this paper, we propose an efficient optimization of the Monte Carlo tree search (MCTS) algorithm for Amazons, fusing the ‘Move Groups’ strategy and the ‘Parallel Evaluation’ optimization strategy (MG-PEO). Specifically, we explain the high efficiency of the Move Groups strategy by defining a new criterion: the winning convergence distance. We also highlight the strategy’s potential issue of falling into a local optimum and propose that the Parallel Evaluation mechanism can compensate for this shortcoming. Moreover, We conducted rigorous performance analysis and experiments. Performance analysis results indicate that the MCTS algorithm with the Move Groups strategy can improve the playing ability of the Amazons game by 20–30 times compared to the traditional MCTS algorithm. The Parallel Evaluation optimization further enhances the playing ability of the Amazons game by 2–3 times. Experimental results show that the MCTS algorithm with the MG-PEO strategy achieves a 23% higher game-winning rate on average compared to the traditional MCTS algorithm. Additionally, the MG-PEO Amazons program proposed in this paper won first prize in the Amazons Competition at the 2023 China Collegiate Computer Games Championship & National Computer Games Tournament.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1999-4893
1999-4893
DOI:10.3390/a17080334