Linear-time disk-based implicit graph search

DOI10.1145/1455248.1455250MaRDI QIDQ3452192zbMATH OpenOpenAlexFDO

Authors Richard E. Korf

Publication date 11 November 2015

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1455248.1455250

zbMATH Keywords

external memorymagnetic disk storagepermutation encodingsRubik's cubesliding-tile puzzlesTowers of Hanoi

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Space complexity of combinatorial search
• Breadth-first heuristic search
• KI 2004: Advances in Artificial Intelligence
• Linear-space best-first search
• Frontier search

Cited in

(8)

• A framework for analysing state-abstraction methods
• Predicting optimal solution cost with conditional probabilities
• Coloring Hanoi and Sierpiński graphs
• scientific article; zbMATH DE number 1882050 (Why is no real title available?)
• scientific article; zbMATH DE number 1882054 (Why is no real title available?)
• KI 2004: Advances in Artificial Intelligence
• Generalized planning as heuristic search: a new planning search-space that leverages pointers over objects
• A mathematical model and a computer tool for the Tower of Hanoi and Tower of London puzzles

This page was built for publication: Linear-time disk-based implicit graph search

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3452192)