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

Abstract. 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. 00000000000000000000000000000000 000000000000000000000000000000000000000000000000 11111111111111111111111111111111 111111111111111111111111111111111111111111111111 000000 000000 000000 000000 111111 111111 111111 111111000000000 000000 111111111 111111

• Type: Conference
• Year: 1999
• Where: STACS
• Authors: Mario Szegedy
• Keywords: Classical Towers, Hanoi Games, STACS 1999, Theoretical Computer Science