A loopless approach for constructing a fastest algorithm for the towers of hanoi problem

References

• Buneman , P. and Levy , L. 1980 . The Towers of Hanoi problem . Information Processing Letters , 10 : 243 – 244 .
   Web of Science ®Google Scholar
• Dijkstra E. W. A Short Introduction to the Art of Programming, EWD 1971 316
   Google Scholar
• Ehrlich , G. 1973 . Loopless algorithms for generating permutations, combinations, and other combinatorial configurations . Journal of the ACM , 20 : 500 – 513 .
   Web of Science ®Google Scholar
• Er , M.C. 1982 . A representation approach to the Tower of Hanoi problem . The Computer Journal , 25 : 442 – 447 .
   Web of Science ®Google Scholar
• Er , M.C. 1984 . The Towers of Hanoi problem—A reply . The Computer Journal , 27 : 285
   Web of Science ®Google Scholar
• M , C. 1985 . The Towers of Hanoi and binary numerals . Journal of Information and Optimization Sciences , 6 : 147 – 152 .
   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
• Walsh , T.R. 1982 . The Towers of Hanoi revisited: Moving the rings by counting the moves . Information Processing Letters , 15 : 64 – 67 .
   Web of Science ®Google Scholar