7 search results - page 1 / 2 » An Improved Safety Solver for Computer Go |
CG
2004
Springer
13 years 9 months ago
2004
Springer
Most Go-playing programs use a combination of search and heuristics based on an influence function to determine whether territories are safe. However, to assure the correct evaluat...
CG
2006
Springer
13 years 9 months ago
2006
Springer
This paper presents SAFETY SOLVER 2.0, a safety-of-territory solver for the game of Go that can solve problems in areas with open boundaries. Previous work on assessing safety of t...
CG
2010
Springer
13 years 3 months ago
2010
Springer
Monte-Carlo Tree Search (MCTS) is a successful algorithm used in many state of the art game engines. We propose to improve a MCTS solver when a game has more than two outcomes. It ...
CG
2008
Springer
13 years 7 months ago
2008
Springer
Recently, Monte-Carlo Tree Search (MCTS) has advanced the field of computer Go substantially. In this article we investigate the application of MCTS for the game Lines of Action (L...
JCM
2007
13 years 5 months ago
2007
—Today, most routing problems are solved using Dijkstra’s shortest path algorithm. Many efficient implementations of Dijkstra’s algorithm exist and can handle large networks ...