Paper Info
Title
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.
Year
DOI
Venue
1999
10.1007/3-540-49116-3_33
STACS
Keywords
Field
DocType
constants ck,n disk,classical towers,hanoi game,lower bound
Discrete mathematics,Data structure,Combinatorics,Upper and lower bounds,Mathematics,Computational complexity theory
Conference
Volume
ISSN
ISBN
1563
0302-9743
3-540-65691-X
Citations 
PageRank 
References 
10
1.28
5
Authors
1
Name
Order
Citations
PageRank
Mario Szegedy13358325.80