Santa claus' towers of hanoi

Graphs and Combinatorics

Volumn 23, Issue SUPPL. 1, 2007, Pages 153-167

  Chen, Xiaomin ^a   Tian, Bin ^a   Wang, Lei ^a  

^a RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 34547289044     PISSN: 09110119     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00373-007-0705-4     Document Type: Article

References (13)

1. Atkinson, M. D.: The cyclic towers of Hanoi. Inf. Process. Lett. 13(3), 118-119 (1981)
2. Chen, X., Shen, J., On the Frame-Stewart conjecture about the Towers of Hanoi. SIAM J. Comput. 33(3), 584-589 (2004)
3. Claus, N., (= Lucas, E.): La Tour d Hanoi. Jeu de calcul. Sci. Nat. 1(8), 127-128 (1884)
4. Dinitz, Y., Solomon, S.: Optimality of an algorithm solving the Bottleneck tower of Hanoi problem, a manucript, 2006
5. Frame, J. S.: Solution to advanced problem 3918. Am. Math. Mon. 48, 216-217 (1941)
6. Klavžar, S., Milutinović, U., Petr, C.: On the Frame-Stewart algorithm for the multi-peg Tower of Hanoi problem. Discrete Appl. Math. 120(1-3), 141-157 (2002)
7. Klein, C. S., Minsker, S.: The super Towers of Hanoi problem: large rings on small rings. Discrete Math. 114(1-3), 283-295 (1993)
8. Poole, D.: The Bottleneck Towers of Hanoi problem. J. Recreat. Math. 24(3), 203-207 (1992)
9. Stewart, B. M.: Advanced problem 3918. Am. Math. Mon. 46, 363 (1939)
10. Stewart, B. M.: Solution to advanced problem 3918. Am. Math. Mon. 48, 217-219 (1941)
11. Stockmeyer, P. K.: The Tower of Hanoi: A Historical Survey and Bibliography, manuscript available at http://www.cs.wm.edu/~pkstoc/biblio.ps, 2001
12. Szegedy, M.: In how many steps the k peg version of the Towers of Hanoi game can be solved? STAGS 99 (Trier), pp. 356-361, Lecture Notes in Computer Science vol. 1563. Springer, Berlin, 1999
13. Wood, D.: Towers of Brahma and Hanoi Revisited. J. Recreat. Math. 14, 17-24 (1981)