Two-Stage Monte Carlo Tree Search for Connect6

Recently, Monte Carlo tree search (MCTS) has become a well-known game search method, and has been successfully applied to many games. This method performs well in solving search trees with numerous branches, such as Go, Havannah, etc. Connect6 is a game involving a search tree with numerous branches...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:IEEE transactions on computational intelligence and AI in games. Ročník 3; číslo 2; s. 100 - 118
Hlavní autori: Yen, Shi-Jim, Yang, Jung-Kuei
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: IEEE 01.06.2011
Predmet:
Algorithms
Artificial intelligence
Board games
Connect6
conservative TSS
Estimates
Games
Intelligence
Iterative algorithm
iterative TSS
Law
Monte Carlo methods
Monte Carlo tree search
Search methods
Searching
threat space search
Trees
Vegetation
ISSN:1943-068X, 1943-0698
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:Recently, Monte Carlo tree search (MCTS) has become a well-known game search method, and has been successfully applied to many games. This method performs well in solving search trees with numerous branches, such as Go, Havannah, etc. Connect6 is a game involving a search tree with numerous branches, and it is also one of the sudden-death games. This paper thus proposes a new MCTS variant related to Connect6, called two-stage MCTS. The first stage focuses on threat space search (TSS), which is designed to solve the sudden-death problem. For the double-threat TSS in Connect6, this study proposes an algorithm called iterative threat space search (ITSS) which combines normal TSS with conservative threat space search (CTSS). The second stage uses MCTS to estimate the game-theoretic value of the initial position. This stage aims at finding the most promising move. The experimental result shows that two-stage MCTS is considerably more efficient than traditional MCTS on those positions with TSS solution in Connect6. Furthermore, according to Connect6 heuristic knowledge, this paper uses relevance-zone search to accelerate identifying winning and losing moves.
Bibliografia:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:1943-068X
1943-0698
DOI:10.1109/TCIAIG.2011.2134097