An iterative algorithm for the Tower of Hanoi with four pegs

DOI10.1007/BF02239743zbMath0672.05016MaRDI QIDQ1119589

Andreas M. Hinz

Publication date: 1989

Published in: Computing (Search for Journal in Brave)

zbMATH Keywords

algorithmsTower of Hanoi

Mathematics Subject Classification ID

Enumerative combinatorics (05A99) Algorithms in computer science (68W99)

Related Items (6)

On the Frame-Stewart algorithm for the multi-peg Tower of Hanoi problem ⋮ The Divide-and-Conquer Approach to the Generalizedp-Peg Tower of Hanoi Problem ⋮ Shortest paths between regular states of the Tower of Hanoi ⋮ Parallelism for multipeg towers of Hanoi ⋮ Nonrecursive solution to parallel multipeg towers of Hanoi: A decomposition approach ⋮ Hanoi graphs and some classical numbers

Cites Work

• Performance evaluations of recursive and iterative algorithms for the Towers of Hanoi Problem
• The tower of Hanoi
• Towers of Hanoi and Analysis of Algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An iterative algorithm for the Tower of Hanoi with four pegs