Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
10325208 | Information Sciences | 2005 | 19 Pages |
Abstract
The Graph-History interaction (GHI) problem is a notorious problem that causes game-playing programs to occasionally return incorrect solutions. This paper presents a practical method to cure the GHI problem for the case of the df-pn algorithm. Results in the game of Go with the situational super-ko rule show that the overhead incurred by our method is very small, while correctness is always guaranteed.
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
Authors
Akihiro Kishimoto, Martin Müller,