843 search results - page 2 / 169 » Monte-Carlo Go Developments |
CIG
2006
IEEE
13 years 11 months ago
2006
IEEE
Abstract— This paper describes experiments using reinforcement learning techniques to compute pattern urgencies used during simulations performed in a Monte-Carlo Go architecture...
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:
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...
CIG
2005
IEEE
13 years 11 months ago
2005
IEEE
We present a way to integrate search and Monte-Carlo methods in the game of Go. Our program uses search to find the status of tactical goals, builds groups, selects interesting go...
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...