The cyclic towers of Hanoi
From MaRDI portal
Publication:1155964
DOI10.1016/0020-0190(81)90123-XzbMath0467.68083OpenAlexW2002949480MaRDI QIDQ1155964
Publication date: 1981
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(81)90123-x
Related Items
A note on parallelism for the towers of Hanoi ⋮ Santa Claus' Towers of Hanoi ⋮ The diameter of Hanoi graphs ⋮ The Cyclic Towers of Hanoi and Pseudo Ternary Codes ⋮ A loopless approach to the multipeg towers of hanoi ⋮ Tours de Hanoï et automates ⋮ An iterative algorithm for the cyclic Towers of Hanoi problem ⋮ The worst parallel Hanoi graphs ⋮ The worst Hanoi graphs ⋮ A tour of general Hanoi graphs ⋮ Comparison of C, Java, Python and Matlab programming languages for Fibonacci and Towers of Hanoi algorithm applications ⋮ The tower of Hanoi problem on Path\(_h\) graphs ⋮ Exponential vs. Subexponential Tower of Hanoi Variants ⋮ Unnamed Item ⋮ The Cyclic Towers of Antwerpen problem -- a challenging Hanoi variant ⋮ Towers of hanoi problem with arbitraryk≧3 pages ⋮ The towers of Antwerpen problem ⋮ A statistical analysis of the towers of hanoi problem ⋮ The super towers of Hanoi problem: Large rings on small rings ⋮ A generalization of the cyclic towers of hanoi: an iterative solution ⋮ The Generalized Towers of Hanoi Problem ⋮ The Colour Towers of Hanoi – An Iterative Solution ⋮ The towers of Hanoi problem with parallel moves ⋮ The towers of Hanoi problem with cyclic parallel moves ⋮ An optimal algorithm to implement the Hanoi towers with parallel moves ⋮ Parallelism for multipeg towers of Hanoi ⋮ Recursive information transducers: Computation models ⋮ Iteration strikes back - at the cyclic Towers of Hanoi ⋮ An iterative solution to the generalized Towers of Hanoi problem ⋮ A probabilistic analysis of an error-correcting algorithm for the Towers of Hanoi puzzle ⋮ Note on the cyclic towers of Hanoi ⋮ Towers of Hanoi problems: deriving iterative solutions by program transformations
Cites Work
