Advanced search
Publication Cover
International Journal of Computer Mathematics Volume 28, 1989 - Issue 1-4
Submit an article Journal homepage
56
Views
18
CrossRef citations to date
0
Altmetric
Original Articles

A statistical analysis of the towers of hanoi problem

Tat-Hung Chan Department of Computer Science, University of Hong Kong, Pokfulam Road, Hong Kong; Department of Mathematics and Computer Science, State University College, Fredonia, NY, 14063, USA
Pages 57-65 | Received 23 May 1988, Published online: 19 Mar 2007

Citations (18)

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 (2)

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

Articles from other publishers (16)

KEQIN CUI, WENJIA MA & LIFENG XI. (2023) EXACT FORMULA OF DISTANCE SUMS ON SIERPIŃSKI SKELETON NETWORKS. Fractals 31:09.
Crossref
QIN WANG & QINGCHENG ZENG. (2023) ACCURATE FORMULAS OF HYPER-WIENER INDICES OF SIERPIŃSKI SKELETON NETWORKS. Fractals 31:07.
Crossref
Sanghun Bang & Charles Tijus. 2021. Computational Intelligence. Computational Intelligence 129 146 .
Xingchao Deng, Zhiwei Shao, Huan Zhang & Weihua Yang. (2019) The (d, 1)-total labelling of Sierpi ski-like graphs . Applied Mathematics and Computation 361, pages 484-492.
Crossref
Hanlin Chen, Renfang Wu, Guihua Huang & Hanyuan Deng. (2015) Dimer–monomer model on the Towers of Hanoi graphs. International Journal of Modern Physics B 29:23, pages 1550173.
Crossref
Bing Xue, Liancui Zuo & Guojun Li. (2014) Coloring the Square of Sierpiński Graphs. Graphs and Combinatorics 31:5, pages 1795-1805.
Crossref
Bing Xue, Liancui Zuo, Guanghui Wang & Guojun Li. (2013) The Linear t-Colorings of Sierpiński-Like Graphs. Graphs and Combinatorics 30:3, pages 755-767.
Crossref
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 & Daniele Parisse. (2012) Coloring Hanoi and Sierpiński graphs. Discrete Mathematics 312:9, pages 1521-1535.
Crossref
Sandi Klavˇzar. (2008) COLORING SIERPIN´ SKI GRAPHS AND SIERPIN´ SKI GASKET GRAPHS. Taiwanese Journal of Mathematics 12:2.
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
A. A. K. Majumdar. (2009) Generalized multi-peg tower of hanoi problem. The Journal of the Australian Mathematical Society. Series B. Applied Mathematics 38:2, pages 201-208.
Crossref
Ian Stewart. (2009) Four encounters with sierpińriski’s gasket. The Mathematical Intelligencer 17:1, pages 52-64.
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
Andreas M. Hinz & Andreas Schief. (1990) The average distance on the Sierpiński gasket. Probability Theory and Related Fields 87:1, pages 129-138.
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.