In How Many Steps the k Peg Version of the Towers of Hanoi Game Can Be Solved?

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.

[1]  Lu. Xue-Miao,et al.  A loopless approach to the multipeg towers of hanoi , 1990 .

[2]  Somenath Biswas,et al.  The generalized towers of Hanoi , 1979, SIGA.

[3]  Ronald L. Graham,et al.  Concrete Mathematics, a Foundation for Computer Science , 1991, The Mathematical Gazette.

[4]  Ronald L. Graham,et al.  Concrete mathematics - a foundation for computer science , 1991 .

[5]  Jean-Paul Allouche,et al.  Note on the Cyclic Towers of Hanoi , 1994, Theor. Comput. Sci..

[6]  Steven Minsker,et al.  The Towers of Hanoi Rainbow Problem: Coloring the Rings , 1989, J. Algorithms.

[7]  John Beidler,et al.  Data Structures and Algorithms , 1996, Wiley Encyclopedia of Computer Science and Engineering.