Landmark Heuristics for the Pancake Problem
Malte Helmert · Proceedings of the International Symposium on Combinatorial Search · 2010
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.