An analysis of the generalized Towers of Hanoi problem

DOI10.1007/BF01933618zbMath0523.68057OpenAlexW2012280844MaRDI QIDQ1056547

M. C. Er

Publication date: 1983

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01933618

zbMATH Keywords

shortest-path tree23, 429-435 (1983)generalized Towers of Hanoi problemstate-space graph

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Related Items

The complexity of an optimal algorithm for the generalized tower of hanoi problem ⋮ The average distance on the Sierpiński gasket ⋮ Graphs S(n, k) and a Variant of the Tower of Hanoi Problem

Cites Work

• The Towers of Hanoi Problem
• The Generalized Towers of Hanoi Problem
• A Representation Approach to the Tower of Hanoi Problem
• Discussion and correspondence: A note on the Towers of Hanoi problem