Pattern Databases

@article{Culberson1998PatternD,
  title={Pattern Databases},
  author={J. Culberson and J. Schaeffer},
  journal={Computational Intelligence},
  year={1998},
  volume={14}
}
  • J. Culberson, J. Schaeffer
  • Published 1998
  • Computer Science
  • Computational Intelligence
  • The efficiency of A* searching depends on the quality of the lower bound 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, all possible subgoals are looked up in the pattern database, with the maximum cost over all lookups being the lower bound. For sliding tile puzzles… CONTINUE READING

    Topics from this paper.

    Analyzing the Performance of Pattern Database Heuristics
    • 12
    • Open Access
    Compressed Pattern Databases
    • 50
    • Open Access
    Recent Results from Analyzing the Performance of Heuristic Search
    • 8
    • Open Access
    Compressing Pattern Databases
    • 35
    • Open Access
    Maximizing over multiple pattern databases speeds up heuristic search
    • 60
    • Open Access
    Automated Pattern Database Design
    • 1
    • Highly Influenced
    • Open Access
    Structural-Pattern Databases
    • 16
    • Open Access
    Automated Creation of Pattern Database Search Heuristics
    • 38
    • Highly Influenced
    Finding Optimal Solutions to Sokoban Using Instance Dependent Pattern Databases
    • 16

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 25 REFERENCES
    Finding Optimal Solutions to Rubik's Cube Using Pattern Databases
    • 288
    • Open Access
    Finding Optimal Solutions to the Twenty-Four Puzzle
    • 111
    Pruning Duplicate Nodes in Depth-First Search
    • 90
    Depth-First Iterative-Deepening: An Optimal Admissible Tree Search
    • R. Korf
    • Mathematics, Computer Science
    • 1985
    • 1,560
    • Highly Influential
    • Open Access
    Linear-Space Best-First Search
    • R. Korf
    • Mathematics, Computer Science
    • 1993
    • 330
    Real-Time Heuristic Search
    • R. Korf
    • Mathematics, Computer Science
    • 1990
    • 1,001
    Enhanced Iterative-Deepening Search
    • 152
    • Open Access