20
Views
4
CrossRef citations to date
0
Altmetric
Original Articles

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

Pages 1-8 | Received 14 Dec 1989, 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 (1)

A. J. van Zanten. (1991) An iterative optimal algorithm for the generalized tower of hanoi problem. International Journal of Computer Mathematics 39:3-4, pages 163-168.
Read now

Articles from other publishers (3)

Bing Xue, Liancui Zuo, Guanghui Wang & Guojun Li. (2014) Shortest paths in Sierpiński graphs. Discrete Applied Mathematics 162, pages 314-321.
Crossref
Andreas M. Hinz, Sandi Klavžar, Uroš Milutinović, Daniele Parisse & Ciril Petr. (2005) Metric properties of the Tower of Hanoi graphs and Stern’s diatomic sequence. European Journal of Combinatorics 26:5, pages 693-708.
Crossref
Uwe Zimmermann, Ulrich Derigs, Wolfgang Gaul, Rolf H. Möhring & Karl-Peter SchusterLutz Kämmerer & Lorenz Hempel. 1997. Operations Research Proceedings 1996. Operations Research Proceedings 1996 84 89 .

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.