Linear-time disk-based implicit graph search

DOI10.1145/1455248.1455250zbMath1325.68218OpenAlexW2046915582MaRDI QIDQ3452192

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

sliding-tile puzzlesRubik's cubeexternal memoryTowers of Hanoimagnetic disk storagepermutation encodings

Mathematics Subject Classification ID

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

Related Items (4)

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 ⋮ A framework for analysing state-abstraction methods

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