Optimality of an algorithm solving the Bottleneck Tower of Hanoi problem

ACM Transactions on Algorithms

Volumn 4, Issue 3, 2008, Pages

  Dinitz, Yefim ^a   Solomon, Shay ^a  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

Optimality proofs; Tower of Hanoi

Indexed keywords

MOVING STRATEGY; OPTIMAL ALGORITHMS; OPTIMALITY; TOWER OF HANOI;

BUILDINGS; DISKS (STRUCTURAL COMPONENTS); POLYETHYLENE GLYCOLS; TOWERS;

BOOLEAN FUNCTIONS;

EID: 47249111744     PISSN: 15496325     EISSN: 15496333     Source Type: Journal    
DOI: 10.1145/1367064.1367065     Document Type: Article

References (9)

1. BENDITKIS, S., AND SAFRO, I. 1998. Generalizations of the Tower of Hanoi problem. Final project report, supervised by D. Berend. Dept. of Mathematics and Computer Science, Ben-Gurion University, Israel.
2. CHEN, X., TIAN, B., AND WANG, L. 2007. Santa Claus' Towers of Hanoi. Graphs and Combinatorics 23[Supplement], 153-167.
3. DINITZ, Y., AND SOLOMON, S. 2006. Optimal algorithms for Tower of Hanoi problems with relaxed placement rules. In Proceedings of the 17th International Symposium on Algorithms and Computation (ISAAC'2006), T. Asano, Ed. Lecture Notes in Computer Science, vol. 4288. Springer-Verlag, Berlin-Heidelberg, Germany, 36-47.
4. DINITZ, Y., AND SOLOMON, S. 2007. On optimal solutions for the Bottleneck Tower of Hanoi problem. In Proceedings of the 33rd International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM'2007), J. van Leeuwen, J. Italiano, W. van der Hoek, C. Meinel, H. Sack, and F. Plášil, Eds. Lecture Notes in Computer Science, vol. 4362 Springer-Verlag, Berlin-Heidelberg, Germany, 248-259.
5. POOLE, D. 1992. The bottleneck Towers of Hanoi problem. J. Recreat. Math. 24, 3, 203-207.
6. SOLOMON, S. 2006. Algorithms and lower bounds on Tower of Hanoi problems. M.S. dissertation Dept. of Computer Science, Ben-Gurion University, Israel.
7. STOCKMEYER, P. K. 2007. The Tower of Hanoi: A bibliography. Available via http://www.cs.wm.edu/∼pkstoc/biblio2.pdf.
8. SZEGEDY, M. 1999. In how many steps the k peg version of the Towers of Hanoi game can be solved? In Proceedings of the 16th Symposium on Theoretical Aspects of Computer Science (STACS'1999), C. Meinel and S. Tison, Eds. Lecture Notes in Computer Science, vol. 1563. Springer-Verlag, Berlin-Heidelberg, Germany, 356-361.
9. WOOD, D. 1981. The Towers of Brahma and Hanoi revisited. J. Recreat. Math. 14, 1, 17-24.