Searching graphs using mixed strategies
Giovanni Manzini · Journal of Experimental & Theoretical Artificial Intelligence · 1991
In this paper we describe a collection of heuristic search algorithms which use mixed ‘best-first’ and ‘depth-first’ strategies. These algorithms are designed to match the actual features of modern computers that have a large amount of memory but not enough to execute a pure best-first search. Our algorithms start executing a best-first search and when they run out of memory switch to an ‘intelligent’ depth-first search, where the information gathered during the previous phase is utilized to speed up the search process.