Linear-time disk-based implicit graph search

DOI10.1145/1455248.1455250zbMATH Open1325.68218OpenAlexW2046915582MaRDI QIDQ3452192FDOQ3452192

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

Recommendations

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

zbMATH Keywords

external memoryTowers of HanoiRubik's cubemagnetic disk storagepermutation encodingssliding-tile puzzles

Mathematics Subject Classification ID

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

Cited In (8)

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

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)