In a search graph a node’s value may be dependent on the path leading to it. Different paths may lead to different values. Hence, it is difficult to determine the value of any node unambiguously. The problem is known as the graph-history-interaction (GHI) problem. This paper provides a solution for best-first search. First, we give a precise formulation of the problem. Then, for best-first search and for other searches, we review earlier proposals to overcome the problem. Next, our solution is given in detail. Here we introduce the notion of twin nodes, enabling a distinction of nodes according to their history. The implementation, called BTA (Base-Twin Algorithm), is performed for pn search, a best-first search algorithm. It is generally applicable to other best-first search algorithms. Experimental results in the field of computer chess confirm the claim that the GHI problem has been solved for best- first search.
CITATION STYLE
Breuker, D. M., van den Herik, H. J., Uiterwijk, J. W. H. M., & Allis, L. V. (1999). A solution to the GHI problem for best-first search. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1558, pp. 25–49). Springer Verlag. https://doi.org/10.1007/3-540-48957-6_3
Mendeley helps you to discover research relevant for your work.