Landmark Heuristics for the Pancake Problem

Authors

  • Malte Helmert Albert-Ludwigs-Universität Freiburg

DOI:

https://doi.org/10.1609/socs.v1i1.18176

Abstract

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.

Proceedings Cover

Downloads

Published

2010-08-25

How to Cite

Helmert, M. (2010). Landmark Heuristics for the Pancake Problem. Proceedings of the International Symposium on Combinatorial Search, 1(1), 109–110. https://doi.org/10.1609/socs.v1i1.18176

Issue

Vol. 1 No. 1 (2010): Third Annual Symposium on Combinatorial Search

Section

Posters