Heuristic Search in Restricted Memory

Abstract This paper presents heuristic search algorithms which work within memory constraints. These algorithms, MA∗ (for ordinary graphs) and MAO∗ (for AND/OR graphs) guarantee admissible solutions within specified memory limitations (above the minimum required). The memory versus node expansions tradeoff is analyzed for the worst case. In the case of ordinary graphs, some experiments using the Fifteen Puzzle problem are carried out under various pruning conditions. These parameterized algorithms are found to encompass a wide class of best first search algorithms.