85 search results - page 1 / 17 » Heuristics in Monte Carlo Go |
ICAI
2009
13 years 2 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:
ICAI
2007
13 years 6 months ago
2007
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...
ICGA
2007
13 years 4 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...
AAAI
2006
13 years 6 months ago
2006
Monte Carlo Go is a promising method to improve the performance of computer Go programs. This approach determines the next move to play based on many Monte Carlo samples. This pap...