The towers of hanoi: generalizations, specializations and algorithms

References

• Boardman , J. T. , Garrent , C. and Robson , G. 1986 . A recursive algorithm for the optimal solution of a complex allocation problem using a dynamic programming formulation . The Computer Journal , 29 ( 2 ) : 182 – 186 .
   Web of Science ®Google Scholar
• Boardman , J. T. and Robson , G. 1986 . Towards a problem solving methodology for coping with complexity: An engineering approach . The Computer Journal , 29 ( 2 ) : 161 – 166 .
   Web of Science ®Google Scholar
• Fredman , M. L. and Knuth , D. E. 1974 . Recurrence relations based on minimization . Journal of Mathematical Analysis and Applications , 48 ( 2 ) : 534 – 559 .
   Web of Science ®Google Scholar
• Gupta , P. 1991 . “ M. Tech dissertation ” . In New Optimal and Approximate Algorithms For Some Combinatorial Problems , Kharagpur : Indian Institute of Technology .
   Google Scholar
• Scarioni F. Speranza H. G. A Probalistic Analysis Of An Error-Correcting Algorithm for the Towers of Hanoi Puzzle Information and Processing Letters
   Google Scholar
• Newman-Wolfe , R. 1986 . Observations on Multi-peg Towers of Hanoi , Vol. TR 187 , University of Rochester .
   Google Scholar