Advanced search
Publication Cover
International Journal of Computer Mathematics Volume 14, 1983 - Issue 3-4
Submit an article Journal homepage
13
Views
13
CrossRef citations to date
0
Altmetric
Original Articles

Adjudicating a towers of hanoi contestFootnote†

D. Wood Department of Computer Science, University of Waterloo, Waterloo, Ontario, N2L 3G1, Canada
Pages 199-207 | Received 01 Jan 1983, Published online: 20 Mar 2007

Citations (13)

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

Subscribe to citation updates

Read on this site (7)

David G. Poole. (1994) The Towers and Triangles of Professor Claus (or, Pascal Knows Hanoi). Mathematics Magazine 67:5, pages 323-344.
Read now
A. J. Van Zanten. (1990) The complexity of an optimal algorithm for the generalized tower of hanoi problem. International Journal of Computer Mathematics 36:1-2, pages 1-8.
Read now
Lu Xue-Miao. (1990) A loopless approach to the multipeg towers of hanoi. International Journal of Computer Mathematics 33:1-2, pages 13-29.
Read now
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
Lu. Xue-Miao. (1988) Towers of hanoi problem with arbitrary k≧3 pages. International Journal of Computer Mathematics 24:1, pages 39-54.
Read now
M.C. Er. (1987) Counter examples to adjudicating a towers of hanoi contest. International Journal of Computer Mathematics 21:2, pages 123-131.
Read now
Lu Xuemiao. (1986) Towers of hanoi graphs. International Journal of Computer Mathematics 19:1, pages 23-38.
Read now

Articles from other publishers (6)

Jonathan Chappelon, Urban Larsson & Akihiro Matsuura. (2017) Two-player Tower of Hanoi. International Journal of Game Theory 47:2, pages 463-486.
Crossref
Shunqi Wu, Zhongzhi Zhang & Guanrong Chen. (2011) Random walks on dual Sierpinski gaskets. The European Physical Journal B 82:1, pages 91-96.
Crossref
Daniel Berend & Amir Sapir. (2006) The diameter of Hanoi graphs. Information Processing Letters 98:2, pages 79-85.
Crossref
X.-M. Lu & T.S. Dillon. (1995) Parallelism for multipeg towers of Hanoi. Mathematical and Computer Modelling 21:3, pages 3-17.
Crossref
Andreas M. Hinz. (1992) Shortest paths between regular states of the Tower of Hanoi. Information Sciences 63:1-2, pages 173-181.
Crossref
M.C. Er. (1987) A General Algorithm for Finding a Shortest Path between two n-Configurations. Information Sciences 42:2, pages 137-141.
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:

Order Reprints Request Corporate Permissions

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:

Request Academic Permissions

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.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.