![]() |
Volumn 252, Issue 1-2, 2001, Pages 121-149
|
A solution to the GHI problem for best-first search
|
Author keywords
Base twin algorithm (BTA); Best first search; Graph history interaction (GHI) problem
|
Indexed keywords
ALGORITHMS;
PROBLEM SOLVING;
THEOREM PROVING;
TREES (MATHEMATICS);
BEST-FIRST SEARCH;
GRAPH-HISTORY-INTERACTION (GHI) PROBLEMS;
GAME THEORY;
|
EID: 0034918602
PISSN: 03043975
EISSN: None
Source Type: Journal
DOI: 10.1016/S0304-3975(00)00079-7 Document Type: Article |
Times cited : (13)
|
References (19)
|