article

Free access

Time complexity of the Towers of Hanoi problem

Authors:

C Gerety,

P CullAuthors Info & Claims

ACM SIGACT News, Volume 18, Issue 1

Pages 80 - 87

https://doi.org/10.1145/8312.8320

Published: 01 March 1986 Publication History

PDF eReader

References

[1]

[1] P. Buneman, L. Levy, The Towers of Hanoi Problem, Information Processing Letters 10(4-5) (1980) 243-244.

Crossref

Google Scholar

[2]

[2] P. Cull, E. Ecklund, Towers of Hanoi and Analysis of Algorithms, American Math Monthly 92(6) (June/July 1985).

Google Scholar

[3]

[3] G. W. Ernst, A. Newell, GPS: A Case Study in Generality and Problem Solving, (Academic Press, New York, 1969).

Google Scholar

[4]

[4] M. Gardner, Mathematical Games: The curious properties of the Gray code and how it can be used to solve puzzles, Scientific American (August 1972) 106-109.

Google Scholar

[5]

[5] L. Goldschlager, A. Lister, Computer Science: A Modern Introduction, (Prentice/Hall International, London, 1982).

Digital Library

Google Scholar

[6]

[6] P. J. Hayes, A note on the Towers of Hanoi problem, Computer Journal 20(3) (1977) 282-285.

Crossref

Google Scholar

[7]

[7] D. Klahr, Goal formation, planning, and learning by pre-school problem solvers or "My socks are in the dryer", Childrens thinking: What develops? (R. S. Siegler (Ed.) Erlbaum, Hillsdale, N.J. 1976).

Google Scholar

[8]

[8] A. M. Tenenbaum, M. J. Augenstein, Data Structures Using Pascal, (Prentice/Hall, Englewood Cliffs, N.J. 1981).

Digital Library

Google Scholar

Cited By

View all

Pallagani VMuppasani BSrivastava BRossi FHoresh LMurugesan KLoreggia AFabiano FJoseph RKethepalli YElkind E(2023)Plansformer toolProceedings of the Thirty-Second International Joint Conference on Artificial Intelligence10.24963/ijcai.2023/839(7158-7162)Online publication date: 19-Aug-2023
https://dl.acm.org/doi/10.24963/ijcai.2023/839
Maidana RParhizkar TGomola AUtne IMosleh A(2023)Supervised dynamic probabilistic risk assessment: Review and comparison of methodsReliability Engineering & System Safety10.1016/j.ress.2022.108889230(108889)Online publication date: Feb-2023
https://doi.org/10.1016/j.ress.2022.108889
Lee JRakhman UNam CKang SPark JKim C(2022)High dimensional object rearrangement for a robot manipulation in highly dense configurationsIntelligent Service Robotics10.1007/s11370-022-00444-415:5(649-660)Online publication date: 1-Nov-2022
https://dl.acm.org/doi/10.1007/s11370-022-00444-4
Show More Cited By

Index Terms

Time complexity of the Towers of Hanoi problem

Recommendations

Twin Towers of Hanoi

In the Twin Towers of Hanoi version of the well known Towers of Hanoi Problem there are two coupled sets of pegs. In each move, one chooses a pair of pegs in one of the sets and performs the only possible legal transfer of a disk between the chosen pegs ...
The Cyclic Towers of Antwerpen problem-A challenging Hanoi variant

The Cyclic Towers of Antwerpen problem consists of three variations on the Cyclic Towers of Hanoi problem, involving the exchange or rotation of three stacks of rings (red, white, blue), subject to the usual Hanoi rules plus the additional constraint ...
Parallelism for multipeg towers of Hanoi

This paper studies parallelism for the multipeg Towers of Hanoi problem, an interesting generalization of the traditional one, by allowing concurrent moves of discs in a single step. Three versions of parallelism are investigated based on two factors: ...

Comments

Information & Contributors

Information

Published In

ACM SIGACT News Volume 18, Issue 1

Summer 1986

40 pages

ISSN:0163-5700

DOI:10.1145/8312

Editor:
V S Miller

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 March 1986

Published in SIGACT Volume 18, Issue 1

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

10
Total Citations
View Citations
4,059
Total Downloads

Downloads (Last 12 months)1,815
Downloads (Last 6 weeks)90

Reflects downloads up to 12 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Pallagani VMuppasani BSrivastava BRossi FHoresh LMurugesan KLoreggia AFabiano FJoseph RKethepalli YElkind E(2023)Plansformer toolProceedings of the Thirty-Second International Joint Conference on Artificial Intelligence10.24963/ijcai.2023/839(7158-7162)Online publication date: 19-Aug-2023
https://dl.acm.org/doi/10.24963/ijcai.2023/839
Maidana RParhizkar TGomola AUtne IMosleh A(2023)Supervised dynamic probabilistic risk assessment: Review and comparison of methodsReliability Engineering & System Safety10.1016/j.ress.2022.108889230(108889)Online publication date: Feb-2023
https://doi.org/10.1016/j.ress.2022.108889
Lee JRakhman UNam CKang SPark JKim C(2022)High dimensional object rearrangement for a robot manipulation in highly dense configurationsIntelligent Service Robotics10.1007/s11370-022-00444-415:5(649-660)Online publication date: 1-Nov-2022
https://dl.acm.org/doi/10.1007/s11370-022-00444-4
Wang LYue XPeng J(2022)Modeling and Simulation of a Tower-of-Hanoi-Playing Robot Station Based on RobotStudioAdvances in Mechanical Design10.1007/978-981-16-7381-8_92(1507-1521)Online publication date: 16-Mar-2022
https://doi.org/10.1007/978-981-16-7381-8_92
Havur GHaspalamutgil KPalaz CErdem EPatoglu V(2013)Reasoning, execution and monitoring framework for robotic Tower of Hanoi challenge2013 21st Signal Processing and Communications Applications Conference (SIU)10.1109/SIU.2013.6531541(1-4)Online publication date: Apr-2013
https://doi.org/10.1109/SIU.2013.6531541
Havur GHaspalamutgil KPalaz CErdem EPatoglu V(2013)A case study on the Tower of Hanoi challenge: Representation, reasoning and execution2013 IEEE International Conference on Robotics and Automation10.1109/ICRA.2013.6631224(4552-4559)Online publication date: May-2013
https://doi.org/10.1109/ICRA.2013.6631224
Allouche JDress F(2011)Tours de Hanoï et automatesRAIRO - Theoretical Informatics and Applications10.1051/ita/199024010001124:1(1-15)Online publication date: 8-Jan-2011
https://doi.org/10.1051/ita/1990240100011
Van Zanten A(1990)The complexity of an optimal algorithm for the generalized tower of hanoi problemInternational Journal of Computer Mathematics10.1080/0020716900880390536:1-2(1-8)Online publication date: Jan-1990
https://doi.org/10.1080/00207169008803905
Chan T(1989)A statistical analysis of the towers of hanoi problemInternational Journal of Computer Mathematics10.1080/0020716890880372828:1-4(57-65)Online publication date: Jan-1989
https://doi.org/10.1080/00207168908803728
Staples E(1987)The tower of Hanoi problem with arbitrary start and end positionsACM SIGACT News10.1145/24658.2466618:3(61-64)Online publication date: 1-Apr-1987
https://dl.acm.org/doi/10.1145/24658.24666

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

References

Cited By

Index Terms

Recommendations

Twin Towers of Hanoi

The Cyclic Towers of Antwerpen problem-A challenging Hanoi variant

Parallelism for multipeg towers of Hanoi

Comments

Information

Published In

Publisher

Publication History

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations