A Formal Characterization of the Local Search Topology of the Gap Heuristic

TL;DR

This paper provides a formal analysis of the local search topology of the gap heuristic in the pancake puzzle, classifying states based on the number of actions needed to decrease gaps, thereby deepening understanding of heuristic behavior.

Contribution

It offers a complete proof-based characterization of the gap heuristic's local search topology for the pancake puzzle, including state classifications and move implications.

Findings

States with no decreasing move can maintain gaps with certain moves.

States requiring 2 actions to decrease gaps are identified.

States requiring 3 actions to decrease gaps are classified.

Abstract

The pancake puzzle is a classic optimization problem that has become a standard benchmark for heuristic search algorithms. In this paper, we provide full proofs regarding the local search topology of the gap heuristic for the pancake puzzle. First, we show that in any non-goal state in which there is no move that will decrease the number of gaps, there is a move that will keep the number of gaps constant. We then classify any state in which the number of gaps cannot be decreased in a single action into two groups: those requiring 2 actions to decrease the number of gaps, and those which require 3 actions to decrease the number of gaps.