13
Views
4
CrossRef citations to date
0
Altmetric
Original Articles

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

Pages 49-54 | Received 01 Dec 1985, Published online: 19 Mar 2007

Keep up to date with the latest research on this topic with citation updates for this article.

Read on this site (2)

Tat-Hung Chan. (1989) A statistical analysis of the towers of hanoi problem. International Journal of Computer Mathematics 28:1-4, pages 57-65.
Read now
M. C. Er. (1988) A Minimal Space Algorithm for Solving the Towers of Hanoi Problem. Journal of Information and Optimization Sciences 9:2, pages 183-191.
Read now

Articles from other publishers (2)

X.-M. Lu & T.S. Dillon. (1996) Nonrecursive solution to parallel multipeg Towers of Hanoi: A decomposition approach. Mathematical and Computer Modelling 24:3, pages 29-35.
Crossref
M.C. Er. (1989) A Linear space algorithm for solving the towers of hanoi problem by using a virtual disc. Information Sciences 47:1, pages 47-52.
Crossref

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.