Recent progress in heuristic search: A case study of the four-peg Towers of Hanoi problem

Richard E. Korf, Ariel Felner

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

Abstract

We integrate a number of recent advances in heuristic search, and apply them to the four-peg Towers of Hanoi problem. These include frontier search, disk-based search, multiple compressed disjoint additive pattern database heuristics, and breadth-first heuristic search. The main new idea we introduce here is the use of pattern database heuristics to search for any of a number of explicit goal states, with no overhead compared to a heuristic for a single goal state. We perform the first complete breadth-first searches of the 21 and 22-disc four-peg Towers of Hanoi problems, and extend the verification of a "presumed optimal solution" to this problem from 24 to 30 discs, a problem that is 4096 times larger.

Original languageEnglish
Title of host publicationHeuristic Search, Memory-Based Heuristics and their Applications - Papers from the AAAI Workshop, Technical Report
Pages1-6
Number of pages6
StatePublished - 1 Dec 2006
Event2006 AAAI Workshop - Boston, MA, United States
Duration: 16 Jul 200620 Jul 2006

Publication series

NameAAAI Workshop - Technical Report
VolumeWS-06-08

Conference

Conference2006 AAAI Workshop
Country/TerritoryUnited States
CityBoston, MA
Period16/07/0620/07/06

Fingerprint

Dive into the research topics of 'Recent progress in heuristic search: A case study of the four-peg Towers of Hanoi problem'. Together they form a unique fingerprint.

Cite this