Sciweavers

209 search results - page 1 / 42
» Monte Carlo Go Has a Way to Go
Sort
View
AAAI
2006
13 years 6 months ago
Monte Carlo Go Has a Way to Go
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...
Haruhiro Yoshimoto, Kazuki Yoshizoe, Tomoyuki Kane...
CIG
2005
IEEE
13 years 10 months ago
Combining Tactical Search and Monte-Carlo in the Game of Go
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...
Tristan Cazenave, Bernard Helmstetter
TCIAIG
2010
12 years 11 months ago
Evaluating Root Parallelization in Go
Abstract--Parallelizing Monte-Carlo tree search has been considered to be a way to improve the strength of computer Go programs. In this paper, we analyze the performance of two ro...
Yusuke Soejima, Akihiro Kishimoto, Osamu Watanabe
CG
2010
Springer
13 years 2 months ago
Biasing Monte-Carlo Simulations through RAVE Values
Abstract. The Monte-Carlo Tree Search algorithm has been successfully applied in various domains. However, its performance heavily depends on the Monte-Carlo part. In this paper, w...
Arpad Rimmel, Fabien Teytaud, Olivier Teytaud
ACG
2006
Springer
13 years 10 months ago
A Phantom-Go Program
Abstract. This paper presents a Phantom Go program. It is based on a MonteCarlo approach. The program plays Phantom Go at an intermediate level.
Tristan Cazenave