34
Views
0
CrossRef citations to date
0
Altmetric
Original Articles

On uniqueness of solution to the multi-peg towers of hanoi

Pages 57-72 | Received 02 May 2000, Published online: 20 Mar 2007

References

  • Boardman , J.T. , Garrent , C. and Robson , G. 1986 . A Recursive Algorithm of a Complex Allocation Problem Using a Dynamic Programming Formulation . The Computer Journal , 29 ( 2 ) : 182 – 186 .
  • 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 .
  • Fredman , M.L. and Knuth , D.E. 1974 . Recurrence Relations Based on Minimizations . Journal of Mathematical Analysis and Applications , 48 : 534 – 559 .
  • Gupta , P. , Chakrabarti , P.P. and Ghose , S. 1992 . The Towers of Hanoi: Generalizations, Specializations and Algorithms . International Journal of Computer Mathematics , 46 : 149 – 161 .
  • Kaykobad , Md. , Rahman , S.T.-U. , Bakhtiar , R.-A. and Majumdar , A.A.K. 1995 . A Recursive Algorithm for the Multipeg Tower of Hanoi . International Journal of Computer Mathematics , 57 : 67 – 73 .
  • Lu , X.M. 1988 . Towers of Hanoi Problem with Arbitrary k ≥ 3 Pegs . International Journal of Computer Mathematics , 24 : 39 – 54 .
  • Newman-Wolfe , R. 1986 . Observations on Multipeg Towers of Hanoi , University of Rochester . TR187
  • Sarkar , U.K. , Chakrabarti , P.P. , Ghose , S. and De Sarkar , S.C. 1991 . Reducing Re-expansions in Iterative Deepening Search by Controlling Cutoff Bounds . Artificial Intelligence , 51 : 207 – 221 .
  • Sarkar , U.K. , Chakrabarti , P.P. , Ghose , S. and De Sarkar , S.C. 1994 . Improving Greedy Algorithms by Lookahead Search . Journal of Algorithms , 16 : 1 – 23 .
  • Sarkar , U.K. Proceedings of the International Conference on Knowledge Based Computer Systems (KBCS-98) . Solution to Cargo Loading Problem Using Multi-peg Towers of Hanoi - A Heuristic Search Approach . Mumbai , India. pp. 65 – 76 . NCST Publication .
  • Sarkar , U.K. 2000 . “ On the Design of a Constructive Algorithm to Solve the Multi-peg Towers of Hanoi Problem ” . In Theoretical Computer Science , Vol. 237 , 407 – 421 . Elsevier .
  • Veerasamy , J. and Page , I. 1994 . On Towers of Hanoi with Multiple Spare Pegs . International Journal of Computer Mathematics , 52 : 17 – 22 .
  • Zanten , A.J.V. 1991 . An Iterative Optimal Algorithm for the Generalized Tower of Hanoi . International Journal of Computer Mathematics , 39 : 163 – 168 .

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.