A statistical analysis of the towers of hanoi problem

References

• Atkinson , M. D. 1981 . The cyclic Towers of Hanoi . Inf. Processing Letters , 13 : 118 – 119 .
   Web of Science ®Google Scholar
• Ball , R. R. W. 1892 . Mathematical Recreations and Essays , London : Macmillan .
   Google Scholar
• Berlekamp , E. R. , Conway , J. H. and Guy , R. K. Winning ways , London : Academic Press . Games in Particular
   Google Scholar
• Boardman , J. T. , Garrett , C. and Robson , G. C. A. 1986 . A recursive algorithm for the optimal solution of a complex allocation problem using a dynamic programming formulation . The Computer Journal , 29 : 182 – 186 .
   Web of Science ®Google Scholar
• Boardman , J. T. and Robson , G. C. A. 1986 . Towards a problem-solving methodology for coping with increasing complexity: An engineering approach . The Computer Journal , 29 : 161 – 166 .
   Web of Science ®Google Scholar
• Buneman , P. and Levy , L. 1980 . The Towers of Hanoi problem . Inf. Processing Letters , 10 : 243 – 244 .
   Web of Science ®Google Scholar
• Cull , P. and Ecklund , E. F. 1985 . Towers of Hanoi and analysis of algorithms . American Math. Monthly , 92 : 407 – 420 .
   Web of Science ®Google Scholar
• Dijkstra , E. W. 1971 . A Short Introduction to the Art of Programming EWD316
   Google Scholar
• Dudeney , H. E. 1907 . The Canterbury Puzzles , London : Thomas Nelson & Son .
   Google Scholar
• Er , M. C. 1982 . A representation approach to the Tower of Hanoi problem . The Computer Journal , 25 : 442 – 446 .
   Web of Science ®Google Scholar
• Er , M. C. 1984 . The colour Towers of Hanoi: A generalization . The Computer Journal , 27 : 80 – 82 .
   Web of Science ®Google Scholar
• Er , M. C. 1984 . The cyclic Towers of Hanoi: A representation approach . The Computer Journal , 27 : 171 – 175 .
   Web of Science ®Google Scholar
• Er , M. C. 1984 . The generalized colour Towers of Hanoi: An iterative algorithm . The Computer Journal , 27 : 278 – 282 .
   Web of Science ®Google Scholar
• Er , M. C. 1986 . A loopless approach for constructing a fastest algorithm for the Towers of Hanoi problem . Intern. J. Computer Math. , 20 : 49 – 54 .
   Web of Science ®Google Scholar
• Er , M. C. 1987 . Counter examples to adjudicating a Towers of Hanoi contest . Intern. J. Computer Math. , 21 : 123 – 131 .
   Web of Science ®Google Scholar
• Frame , J. S. 1941 . A solution to AMM Problem 3918 . American Math. Monthly , 48 : 216 – 217 .
   Google Scholar
• Gardner , M. 1959 . Mathematical Puzzles and Diversion , New York : Simon & Schuster .
   Google Scholar
• Gardner , M. 1972 . The curious properties of the Gray code and how it can be used to solve puzzles . Scientific American , 227 : 106 – 109 .
   Web of Science ®Google Scholar
• Gerety , C. and Cull , P. 1986 . Time complexity of the Towers of Hanoi problem . Sigact News , 18 ( 1 ) : 80 – 88 .
   Google Scholar
• Hayes , P. J. 1977 . A note on the Towers of Hanoi problem . The Computer Journal , 20 : 282 – 285 .
   Web of Science ®Google Scholar
• Xuemiao , Lu . 1986 . Towers of Hanoi graphs . Intern. J. Computer Math. , 19 : 23 – 38 .
   Web of Science ®Google Scholar
• Purdom , P. W. and Brown , C. A. 1985 . The Analysis of Algorithms , New York : Holt, Rinehart and Winston .
   Google Scholar
• Rohl , J. S. 1985 . The Towers of Hanoi problem . The Computer Journal , 28 : 350 – 350 . Correspondence
   Web of Science ®Google Scholar
• Rohl , J. S. and Gedeon , T. D. 1986 . The Reve's puzzle . The Computer Journal , 29 : 187 – 188 .
   Web of Science ®Google Scholar
• Roth , T. 1974 . The Tower of Brahma revisited . J. Recreational Math. , 7 : 116 – 119 .
   Google Scholar
• Scarioni , F. and Speranza , H. G. 1984 . A probabilistic analysis of an error-correcting algorithm for the Towers of Hanoi puzzle . Inf. Processing Letters , 18 : 99 – 103 .
   Web of Science ®Google Scholar
• Staples , E. 1987 . The Tower of Hanoi problem with arbitrary start and end positions . Sigact News , 18 ( 3 ) : 61 – 64 .
   Google Scholar
• Stewart , B. M. 1939 . Problem 3918 . American Math. Monthly , 46 : 363 – 363 .
   Google Scholar
• Stewart , B. M. 1941 . A solution to AMM Problem 3918 . American Math. Monthly , 48 : 217 – 219 .
   Google Scholar
• Walsh , T. R. 1982 . The Towers of Hanoi revisited: Moving the rings by counting the moves . Inf. Processing Letters , 15 : 64 – 67 .
   Web of Science ®Google Scholar
• Walsh , T. R. 1983 . Iteration strikes back—At the cyclic Towers of Hanoi . Inf. Processing Letters , 16 : 91 – 93 .
   Web of Science ®Google Scholar
• Wood , D. 1981 . The Towers of Brahma and Hanoi revisited . J. Recreational Math. , 14 : 17 – 24 .
   Google Scholar
• Wood , D. 1983 . Adjudicating a Towers of Hanoi contest . Intern. J. Computer Math. , 14 : 199 – 207 .
   Web of Science ®Google Scholar