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 \( 2^{C_k ^{n^{1/(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 C k this bound is tight.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
A.V. Aho, J.E. Hopcroft, J.D. Ullman, Data Structures and Algorithms, Addison-Wesley, 1983
J.-P. Allouche, Note on the Cyclic Towers of Hanoi, Theoretical Comp. Sci. 123 1994, 3–7.
S. Biswas and M.S. Krishnamoorthy, The generalized Towers of Hanoi, Unpublished manuscript, 1978
Br.A. Brousseau, Tower of Hanoi with More Pegs, Journal of Recreational Mathematics, 8:3, pp. 169–176, 1976
J.S. Frame, A Solution to AMM Problem 3918 (1939), American Mathematical Monthly, 48, pp. 216–217, 1941
R. L. Graham, D. E. Knuth, O. Patashnik, Concrete mathematics. A foundation for computer science. Second edition. Addison-Wesley Publishing Company, Reading, MA, 1994. xiv+657 pp.
A. M. Hinz, An iterative algorithm for the tower of Hanoi with four pegs, Computing 42, pp. 133–140 (1989)
Xue-Miao Lu, A loopless approach to the multipeg Towers of Hanoi, International Journal of Computer Mathematics, vol. 33, no. 1/2, pp. 13–29, 1990.
S. Minsker, The Towers of Hanoi rainbow: coloring the rings, Journal of Algorithm, vol. 10, pp. 1–19, 1989.
B.M. Stewart, Solution to Problem 3918, American Mathematical Monthly, vol. 48, pp. 217–219, 1941.
D. Wood, Towers of Brahma and Hanoi Revisited, Journal of Recreational Mathematics, 14:1, pp. 17–24, 1981-82
http://rialto.k12.ca.us/school/frisbie/mathfair/hanoilegend.html
The home page of Xue-Miao Lu at La Trobe: http://www.cs.latrobe.edu.au
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Szegedy, M. (1999). In How Many Steps the k Peg Version of the Towers of Hanoi Game Can Be Solved?. In: Meinel, C., Tison, S. (eds) STACS 99. STACS 1999. Lecture Notes in Computer Science, vol 1563. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49116-3_33
Download citation
DOI: https://doi.org/10.1007/3-540-49116-3_33
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65691-3
Online ISBN: 978-3-540-49116-3
eBook Packages: Springer Book Archive