209 search results - page 3 / 42 » Monte Carlo Go Has a Way to Go |
CG
2006
Springer
13 years 9 months ago
2006
Springer
In the last decade, proof-number search and Monte-Carlo methods have successfully been applied to the combinatorial-games domain. Proof-number search is a reliable algorithm. It re...
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
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...
ACG
2009
Springer
13 years 12 months ago
2009
Springer
With the recent success of Monte-Carlo tree search algorithms in Go and other games, and the increasing number of cores in standard CPUs, the efficient parallelization of the sear...
ACG
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Progressive Pruning (PP) is used in the Monte-Carlo go playing program Indigo. For each candidate move, PP launches random games starting with this move. PP gathers stati...