Iteration strikes back - at the cyclic Towers of Hanoi
From MaRDI portal
Publication:1838033
DOI10.1016/0020-0190(83)90032-7zbMath0508.68020MaRDI QIDQ1838033
Publication date: 1983
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(83)90032-7
68W99: Algorithms in computer science
Related Items
A probabilistic analysis of an error-correcting algorithm for the Towers of Hanoi puzzle, An optimal algorithm to implement the Hanoi towers with parallel moves, Towers of Hanoi problems: deriving iterative solutions by program transformations, Derivation of efficient programs for computing sequences of actions, Recursive information transducers: Computation models, Parallelism for multipeg towers of Hanoi, An iterative algorithm for the cyclic Towers of Hanoi problem, The Cyclic Towers of Hanoi and Pseudo Ternary Codes, A statistical analysis of the towers of hanoi problem
Cites Work