Searching with pattern databases

摘要

The efficiency of A * searching depends on the quality of the lower blound estimates of the solution cost. Pattern databases enumerate all possible subgoals required by any solution, subject to constraints on the subgoal size. Each subgoal in the database provides a tight lower bound on the cost of achieving it. For a given state in the search space, allpossible subgoals are looked up, with the maximum cost over all lookups being the lower bound. For sliding tile puzzles, the database enumerates all possible patterns containing N tiles and, for each one, contains a lower bound on the distance to correctly move all N tiles into their correct final location. For the 15-Puzzle, iterative-deepening A * with pattern databases (N=8+ reduces the total number of nodes searched on a standard problem set of 100 positions by over 1000-fold.