A general algorithm for finding a shortest path between two n- configurations

DOI10.1016/0020-0255(87)90020-XzbMath0636.68039OpenAlexW1976266588MaRDI QIDQ1098292

M. C. Er

Publication date: 1987

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0255(87)90020-x

zbMATH Keywords

generalized Towers of Hanoi contestshortest path between two n-configurations

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99)

Related Items

Four encounters with Sierpiński's gasket ⋮ The complexity of an optimal algorithm for the generalized tower of hanoi problem ⋮ Shortest paths between regular states of the Tower of Hanoi ⋮ A mathematical model and a computer tool for the Tower of Hanoi and Tower of London puzzles

Cites Work

• The Towers of Hanoi Problem
• Adjudicating a towers of hanoi contest†
• A Representation Approach to the Tower of Hanoi Problem
• Discussion and correspondence: A note on the Towers of Hanoi problem