TY - GEN
T1 - Recent progress in heuristic search
T2 - 2006 AAAI Workshop
AU - Korf, Richard E.
AU - Felner, Ariel
PY - 2006/12/1
Y1 - 2006/12/1
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=33846071037&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:33846071037
SN - 1577352904
SN - 9781577352907
T3 - AAAI Workshop - Technical Report
SP - 1
EP - 6
BT - Heuristic Search, Memory-Based Heuristics and their Applications - Papers from the AAAI Workshop, Technical Report
Y2 - 16 July 2006 through 20 July 2006
ER -