7 search results - page 1 / 2 » All-Moves-As-First Heuristics in Monte-Carlo Go |
ICAI
2009
13 years 3 months ago
2009
Abstract-- We present and explore the effectiveness of several variations on the All-Moves-As-First (AMAF) heuristic in Monte-Carlo Go. Our results show that:
ACG
2009
Springer
13 years 12 months ago
2009
Springer
Abstract. We present a new exploration term, more efficient than classical UCT-like exploration terms. It combines efficiently expert rules, patterns extracted from datasets, All-M...
ICAI
2007
13 years 6 months ago
2007
ICGA
2007
13 years 5 months ago
2007
We experimented a simple yet powerful optimization for Monte-Carlo Go tree search. It consists in dealing appropriately with strings that have two liberties. The heuristic is cont...
ACG
2003
Springer
13 years 10 months ago
2003
Springer
We describe two Go programs, ¢¡¤£¦¥ and ¢¡¤§¨£ , developed by a Monte-Carlo approach that is simpler than Bruegmann’s (1993) approach. Our method is based on Abra...