843 search results - page 1 / 169 » Monte-Carlo Go Developments |
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...
ICML
2009
IEEE
14 years 5 months ago
2009
IEEE
In this paper we introduce the first algorithms for efficiently learning a simulation policy for Monte-Carlo search. Our main idea is to optimise the balance of a simulation polic...
ACG
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. Games are considered important benchmark tasks of artificial intelligence research. Modern strategic board games can typically be played by three or more people, which m...
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...
ACG
2006
Springer
13 years 10 months ago
2006
Springer
Abstract. This paper presents a Phantom Go program. It is based on a MonteCarlo approach. The program plays Phantom Go at an intermediate level.