Landmark Heuristics for the Pancake Problem
DOI:
https://doi.org/10.1609/socs.v1i1.18176Abstract
We describe the gap heuristic for the pancake problem, which dramatically outperforms current abstraction-based heuristics for this problem. The gap heuristic belongs to a family of landmark heuristics that have recently been very successfully applied to planning problems.
Downloads
Published
2010-08-25
Issue
Section
Posters