Optimal algorithms for Tower of Hanoi problems with relaxed placement rules

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4288 LNCS, Issue , 2006, Pages 36-47

  Dinitz, Yefim ^a   Solomon, Shay ^a  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

HANOI PROBLEM; NON-TRIVIAL; OPTIMAL ALGORITHM; OPTIMALITY; SIZE DIFFERENCE; TIGHT BOUND;

ALGORITHMS; DISKS (STRUCTURAL COMPONENTS); OPTIMIZATION; TOWERS;

COMPUTATION THEORY;

EID: 47249136343     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11940128_6     Document Type: Conference Paper

References (7)

1. S. Beneditkis and I. Safro. Generalizations of the Tower of Hanoi Problem. Final Project Report, supervised by D. Berend, Dept. of Mathematics and Computer Science, Ben-Gurion University, 1998.
2. X. Chen, B. Tian, and L. Wang. Santa Claus' Towers of Hanoi. Manuscript, 2005.
3. D. Poole. The Bottleneck Towers of Hanoi Problem. J. of Recreational Math. 24 (1992), no.3, 203-207.
4. P.K. Stockmayer. Variations on the Four-Post Tower of Hanoi Puzzle. CONGRESSUS NUMERANTIUM 102 (1994), 3-12. (Pubitemid 126096237)
5. P.K. Stockmayer. The Tower of Hanoi: A Bibliography. (1998). Available via http://www.cs.wm.edu/~pkstoc/h-Papers.html.
6. M. Szegedy, In How Many Steps the k Peg Version of the Towers of Hanoi Game Can Be Solved?, Symposium on Theoretical Aspects of Computer Science 1563 (1999), 356.
7. D. Wood. The Towers of Brahma and Hanoi revisited. J. of Recreational Math. 14 (1981-1982), no.1, 17-24.