Relative-order abstractions for the pancake problem

DOI10.3233/978-1-60750-606-5-745MaRDI QIDQ2999215zbMATH OpenFDO

Authors Malte Helmert, Gabriele Röger

Publication date 11 May 2011

Full work available at URL https://doi.org/10.3233/978-1-60750-606-5-745

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• On the problem of sorting burnt pancakes
• Successor rules for flipping pancakes and burnt pancakes
• Optimally solving permutation sorting problems with efficient partial expansion bidirectional heuristic search

Cited in

(5)

• MM: a bidirectional search algorithm that is guaranteed to meet in the middle
• Two new bidirectional search algorithms
• Learning heuristic functions for large state spaces
• Optimally solving permutation sorting problems with efficient partial expansion bidirectional heuristic search
• Inconsistent heuristics in theory and practice

This page was built for publication: Relative-order abstractions for the pancake problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2999215)