A solution to the GHI problem for depth-first proof-number search

Authors:
Akihiro Kishimoto;Martin Müller
Affiliations:
Department of Computing Science, University of Alberta, Edmonton, Canada T6G 2E8;Department of Computing Science, University of Alberta, Edmonton, Canada T6G 2E8
Venue:
Information Sciences: an International Journal
Year:
2005

Citing 5
Cited 3

Linear-space best-first search

Artificial Intelligence
Proof-number search

Artificial Intelligence
The graph-history interaction: on ignoring position history

ACM '85 Proceedings of the 1985 ACM annual conference on The range of computing : mid-80's perspective: mid-80's perspective
A solution to the GHI problem for best-first search

Theoretical Computer Science
Searching with probabilities

Searching with probabilities

A general solution to the graph history interaction problem

AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Enhancements of proof number search in Connect6

CCDC'09 Proceedings of the 21st annual international conference on Chinese control and decision conference
Minimal proof search for modal logic k model checking

JELIA'12 Proceedings of the 13th European conference on Logics in Artificial Intelligence

Quantified Score

Hi-index	0.07

Visualization

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.