The towers of Hanoi rainbow problem: coloring the rings
Journal of Algorithms
Note on the cyclic towers of Hanoi
Theoretical Computer Science - Special issue on number theory, combinatorics and applications to computer science
Concrete Mathematics: A Foundation for Computer Science
Concrete Mathematics: A Foundation for Computer Science
Data Structures and Algorithms
Data Structures and Algorithms
The cyclic multi-peg Tower of Hanoi
ACM Transactions on Algorithms (TALG)
Optimality of an algorithm solving the Bottleneck Tower of Hanoi problem
ACM Transactions on Algorithms (TALG)
On Optimal Solutions for the Bottleneck Tower of Hanoi Problem
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
On an infinite family of solvable Hanoi graphs
ACM Transactions on Algorithms (TALG)
Optimal algorithms for tower of hanoi problems with relaxed placement rules
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
The Tower of Hanoi problem on Path h graphs
Discrete Applied Mathematics
Diameters, distortion, and eigenvalues
European Journal of Combinatorics
Which multi-peg tower of hanoi problems are exponential?
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
| Hi-index | 0.00 |
In this we paper we consider the version of the classical Towers of Hanoi games where the game-board contains more than three pegs. For k pegs we give a 2Ckn1/(k-2) lower bound on the number of steps necessary for transferring n disks from one peg to another. Apart from the value of the constants Ck this bound is tight.