An iterative algorithm for the Tower of Hanoi with four pegs
From MaRDI portal
Publication:1119589
DOI10.1007/BF02239743zbMath0672.05016MaRDI QIDQ1119589
Publication date: 1989
Published in: Computing (Search for Journal in Brave)
Related Items
The Divide-and-Conquer Approach to the Generalizedp-Peg Tower of Hanoi Problem, Hanoi graphs and some classical numbers, Shortest paths between regular states of the Tower of Hanoi, On the Frame-Stewart algorithm for the multi-peg Tower of Hanoi problem, Parallelism for multipeg towers of Hanoi, Nonrecursive solution to parallel multipeg towers of Hanoi: A decomposition approach
Cites Work