Recent progress in heuristic search: a case study of the four-peg towers of Hanoi problem

摘要: We integrate a number of new and recent advances in heuristic search, apply them to the fourpeg Towers Hanoi problem. These include frontier disk-based parallel processing, multiple, compressed, disjoint, additive pattern database heuristics, breadth-first search. New ideas heuristics based on multiple goal states, method reduce coordination among threads, for reducing calculations. perform first complete searches 21 22-disc problems, extend verification "presumed optimal solutions" this problem from 24 30 discs. Verification 31-disc is progress.