The towers of Hanoi revisited: Moving the rings by counting the moves
From MaRDI portal
Publication:1165783
DOI10.1016/0020-0190(82)90108-9zbMath0487.90099OpenAlexW1974204807MaRDI QIDQ1165783
Publication date: 1982
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(82)90108-9
Related Items (21)
The Towers of Hanoi and Binary Numerals ⋮ A note on parallelism for the towers of Hanoi ⋮ The Cyclic Towers of Hanoi and Pseudo Ternary Codes ⋮ A linear space algorithm for solving the Towers of Hanoi problem by using a virtual disc ⋮ A loopless approach to the multipeg towers of hanoi ⋮ Tours de Hanoï et automates ⋮ A loopless approach for constructing a fastest algorithm for the towers of hanoi problem ⋮ Towers of hanoi graphs ⋮ Towers of hanoi problem with arbitraryk≧3 pages ⋮ A statistical analysis of the towers of hanoi problem ⋮ The Colour Towers of Hanoi – An Iterative Solution ⋮ A Minimal Space Algorithm for Solving the Towers of Hanoi Problem ⋮ An optimal algorithm to implement the Hanoi towers with parallel moves ⋮ Parallelism for multipeg towers of Hanoi ⋮ Nonrecursive solution to parallel multipeg towers of Hanoi: A decomposition approach ⋮ The generalized Towers of Hanoi for space-deficient computers and forgetful humans ⋮ Word calculus in the fundamental group of the Menger curve ⋮ Recursive information transducers: Computation models ⋮ Iteration strikes back - at the cyclic Towers of Hanoi ⋮ A probabilistic analysis of an error-correcting algorithm for the Towers of Hanoi puzzle ⋮ Performance evaluations of recursive and iterative algorithms for the Towers of Hanoi Problem
Cites Work
This page was built for publication: The towers of Hanoi revisited: Moving the rings by counting the moves
