85 search results - page 10 / 17 » Heuristics in Monte Carlo Go |
ICGA
2007
13 years 7 months ago
2007
Abstract. Move patterns are an essential method to incorporate domain knowledge into Go-playing programs. This paper presents a new Bayesian technique for supervised learning of su...
ACG
2006
Springer
14 years 1 months ago
2006
Springer
Probabilistic combinatorial games (PCG) are a model for Go-like games recently introduced by Ken Chen. They differ from normal combinatorial games since terminal position in each ...
WSC
1997
13 years 8 months ago
1997
We investigate the problem of deriving precision estimates for bootstrap quantities. The one major stipulation is that no further bootstrapping will be allowed. In 1992, Efron der...
ICML
2007
IEEE
14 years 8 months ago
2007
IEEE
The UCT algorithm learns a value function online using sample-based search. The TD() algorithm can learn a value function offline for the on-policy distribution. We consider three...
WEA
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. A major task in evolutionary biology is to determine the ancestral relationships among the known species, a process generally referred as phylogenetic reconstruction. In ...