Pattern Databases

@article{Culberson1998PatternD,
  title={Pattern Databases},
  author={Joseph C. Culberson and Jonathan Schaeffer},
  journal={Computational Intelligence},
  year={1998},
  volume={14},
  pages={318-334}
}
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
BETA

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.

327 Citations

0102030'00'04'09'14'19
Citations per Year
Semantic Scholar estimates that this publication has 327 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
SHOWING 1-10 OF 19 REFERENCES

The ZRAM Parallel Search Bench and its Applications

  • A. Brüngger, A. Marzetta, K. Fukuda, J. Nievergelt.
  • Annals of Operations Research (to appear).
  • 1998
2 Excerpts

Unpublished research, University of Alberta

  • W. Holst
  • 1995
1 Excerpt

Similar Papers

Loading similar papers…