Nested Monte-Carlo Search with AMAF Heuristic
Haruhiko Akiyama, Kanako Komiya, Yoshiyuki Kotani · 2010
Nested Monte-Carlo Search, which calls MonteCarlo search in the nested call, has succeeded in the one-person game named Morpion Solitaire. The depth for the nest is called a level, and the runtime increases exponentially in the search for higher level. In the present study, All-Move-As-First heuristic is incorporated in Nested Monte-Carlo Search and the number of search is reduced to maintain a pseudo number of searches in order to achieve the higher level search. Our system generated a new world record 146 moves of the computer search in Morpion Solitaire touching version by this technique.