Pages that link to "Item:Q1165783"
From MaRDI portal
The following pages link to The towers of Hanoi revisited: Moving the rings by counting the moves (Q1165783):
Displaying 21 items.
- A probabilistic analysis of an error-correcting algorithm for the Towers of Hanoi puzzle (Q791323) (← links)
- An optimal algorithm to implement the Hanoi towers with parallel moves (Q1007629) (← links)
- Performance evaluations of recursive and iterative algorithms for the Towers of Hanoi Problem (Q1071509) (← links)
- A linear space algorithm for solving the Towers of Hanoi problem by using a virtual disc (Q1116691) (← links)
- The generalized Towers of Hanoi for space-deficient computers and forgetful humans (Q1272420) (← links)
- Recursive information transducers: Computation models (Q1288659) (← links)
- A note on parallelism for the towers of Hanoi (Q1336867) (← links)
- Parallelism for multipeg towers of Hanoi (Q1804221) (← links)
- Nonrecursive solution to parallel multipeg towers of Hanoi: A decomposition approach (Q1816622) (← links)
- Iteration strikes back - at the cyclic Towers of Hanoi (Q1838033) (← links)
- Word calculus in the fundamental group of the Menger curve (Q2833661) (← links)
- The Colour Towers of Hanoi – An Iterative Solution (Q3330528) (← links)
- Tours de Hanoï et automates (Q3479519) (← links)
- The Towers of Hanoi and Binary Numerals (Q3700851) (← links)
- The Cyclic Towers of Hanoi and Pseudo Ternary Codes (Q3742739) (← links)
- A loopless approach for constructing a fastest algorithm for the towers of hanoi problem (Q3802653) (← links)
- Towers of hanoi graphs (Q3803164) (← links)
- Towers of hanoi problem with arbitrary<i>k</i>≧3 pages (Q3806843) (← links)
- A statistical analysis of the towers of hanoi problem (Q3815308) (← links)
- A loopless approach to the multipeg towers of hanoi (Q4009743) (← links)
- A Minimal Space Algorithm for Solving the Towers of Hanoi Problem (Q5751947) (← links)