The complexity of an optimal algorithm for the generalized tower of hanoi problem

References

• Er , M. C. 1983 . An analysis of the generalized Towers of Hanoi problem . BIT , 23 : 429 – 435 .
   Web of Science ®Google Scholar
• Er , M. C. 1987 . A general algorithm for finding a shortest path between two n-configurations . Inf. Sciences , 42 : 137 – 141 .
   Google Scholar
• Gerety , C. and Cull , P. 1986 . Time complexity of the Towers of Hanoi problem . Sigact News , 18 : 80 – 88 .
   Google Scholar
• Lu , X. 1986 . Towers of Hanoi graphs . Intern. J. Computer Math. , 19 : 23 – 38 .
   Web of Science ®Google Scholar
• Scorer , R. S. , Grundy , P. M. and Smith , C. A. B. 1944 . Some binary games . The Mathematical Gazette , 28 : 96 – 103 .
   Google Scholar
• Staples , E. 1987 . The Tower of Hanoi problem with arbitrary start and end positions . Sigact News , 18 : 61 – 64 .
   Google Scholar
• Chan , Tat-Hung . 1989 . A statistical analysis of the Towers of Hanoi problem . Intern. J. Computer Math. , 28 : 57 – 65 .
   Web of Science ®Google Scholar
• Wood , D. 1983 . Adjudicating a Towers of Hanoi contest . Intern. J. Computer Math. , 14 : 199 – 207 .
   Web of Science ®Google Scholar
• van Zanten A. J. Dassow J. An Optimal Algorithm for the Twin-Tower Problem J. Computer Math submitted to Intern.
   Google Scholar