Early work on optimization-based heuristics for the sliding tile puzzle

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


Optimization-based heuristics may offer very good estimates. But, calculating them may be time consuming, especially if the optimization problem is intractable. This raises the question of their applicability. This paper summarizes early work from the year 2000 on optimization-based heuristics in the context of PDBs for the Tile-Puzzle. We show that an admissible heuristic based on Vertex-Cover (VC) can be calculated in reasonable time over a large collection of small PDBs. When larger PDBs are involved we suggest the idea of using another lookup table that precalculates and stores all possible relevant VC values. This table can be later looked up in a constant time during the search. We discuss the conditions under which this idea can be generalized. Experimental results demonstrate the applicability of these two ideas on the 15- and 24-Puzzle. The first idea appeared in (Felner, Korf, and Hanan 2004) but the second idea is presented here for the first time.

Original languageAmerican English
Title of host publicationPlanning, Search, and Optimization - Papers Presented at the 29th AAAI Conference on Artificial Intelligence, Technical Report
PublisherAI Access Foundation
Number of pages7
ISBN (Electronic)9781577357230
StatePublished - 1 Jan 2015
Event29th AAAI Conference on Artificial Intelligence, AAAI 2015 - Austin, United States
Duration: 25 Jan 201530 Jan 2015

Publication series

NameAAAI Workshop - Technical Report


Conference29th AAAI Conference on Artificial Intelligence, AAAI 2015
Country/TerritoryUnited States

All Science Journal Classification (ASJC) codes

  • General Engineering


Dive into the research topics of 'Early work on optimization-based heuristics for the sliding tile puzzle'. Together they form a unique fingerprint.

Cite this