Solving the Tower of Hanoi Puzzle with Heavy Disks
The Tower of Hanoi puzzle, traditionally solved with light disks, presents unique challenges when using heavy disks. This study focuses on minimizing the total distance traveled by the disks during the solution process. The puzzle's rules allow flexibility in designating the starting and target...
Saved in:
| Published in: | The American mathematical monthly Vol. 132; no. 8; p. 806 |
|---|---|
| Main Author: | |
| Format: | Journal Article |
| Language: | English |
| Published: |
Washington
Taylor & Francis Ltd
14.09.2025
|
| Subjects: | |
| ISSN: | 0002-9890, 1930-0972 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | The Tower of Hanoi puzzle, traditionally solved with light disks, presents unique challenges when using heavy disks. This study focuses on minimizing the total distance traveled by the disks during the solution process. The puzzle's rules allow flexibility in designating the starting and target pegs, prompting an analysis of optimal configurations. The recursive nature of the puzzle reveals that the total distances, denoted as \(a_n\) and \(b_n\) for different peg arrangements, can be expressed through generating functions. The findings indicate that for even numbers of disks, the choice of target peg does not affect the total distance. However, for odd numbers, selecting peg 2 as the target reduces the distance by one move compared to peg 3. This research not only provides insights into the mechanics of the Tower of Hanoi with heavy disks but also connects to broader mathematical concepts, including the Jacobsthal numbers and their applications in related puzzles. |
|---|---|
| AbstractList | The Tower of Hanoi puzzle, traditionally solved with light disks, presents unique challenges when using heavy disks. This study focuses on minimizing the total distance traveled by the disks during the solution process. The puzzle's rules allow flexibility in designating the starting and target pegs, prompting an analysis of optimal configurations. The recursive nature of the puzzle reveals that the total distances, denoted as \(a_n\) and \(b_n\) for different peg arrangements, can be expressed through generating functions. The findings indicate that for even numbers of disks, the choice of target peg does not affect the total distance. However, for odd numbers, selecting peg 2 as the target reduces the distance by one move compared to peg 3. This research not only provides insights into the mechanics of the Tower of Hanoi with heavy disks but also connects to broader mathematical concepts, including the Jacobsthal numbers and their applications in related puzzles. |
| Author | Fried, Sela |
| Author_xml | – sequence: 1 givenname: Sela orcidid: 0000-0002-1547-4925 surname: Fried fullname: Fried, Sela |
| BookMark | eNo1kF1LwzAUhoNMcJv-BCHgdefJSdsklzI_JgwUnNch7RLXOZuZtBvbr7dl8-qcw3l4X3hGZFD72hJyy2DCQMI9AKCSCiYImE0wVUyJ7IIMmeKQgBI4IMOeSXroioxiXHcnZCkOCX74za6qv2izsnTh9zZQ7-jM1L6i7-3xuLF0XzUrOrNmd6CPVfyO1-TSmU20N-c5Jp_PT4vpLJm_vbxOH-ZJiZw1CQeL3DhmSi7zTEm0Iu-2oiiWKaIsFBf9U5i0cEzKEnOXS7csHOY2RzB8TO5Oudvgf1sbG732bai7Ss1RMAYizVhHZSeqDD7GYJ3ehurHhINmoHs9-l-P7vXosx7-BxRkV7A |
| Cites_doi | 10.1007/978-3-0348-0237-6 |
| ContentType | Journal Article |
| Copyright | Copyright Taylor & Francis Ltd. 2025 |
| Copyright_xml | – notice: Copyright Taylor & Francis Ltd. 2025 |
| DBID | AAYXX CITATION JQ2 |
| DOI | 10.1080/00029890.2025.2491975 |
| DatabaseName | CrossRef ProQuest Computer Science Collection |
| DatabaseTitle | CrossRef ProQuest Computer Science Collection |
| DatabaseTitleList | ProQuest Computer Science Collection |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics |
| EISSN | 1930-0972 |
| EndPage | 806 |
| ExternalDocumentID | 10_1080_00029890_2025_2491975 |
| Genre | News |
| GroupedDBID | -DZ -ET -~X 0BK 0R~ 123 23M 2FS 30N 6OB 85S 8S2 9EM AAGDL AAHIA AAJMT AALDU AAMIU AAPUL AAQRR AAYXX ABCQX ABEFU ABIFP ABJNI ABLIJ ABLJU ABPAQ ABPFR ABPPZ ABXUL ABXYU ABYWD ABZEH ACGFO ACGFS ACGOD ACIWK ACMTB ACNCT ACTIO ACTMH ADFET ADGTB AEISY AENEX AEYOC AFRVT AFXHP AGDLA AHDZW AIYEW AKBVH AKOOK ALMA_UNASSIGNED_HOLDINGS ALQZU AQRUH AWYRJ BKOMP BLEHA CCCUG CITATION CJ0 CS3 DGEBU E.L EBS F5P H13 HF~ IPNFZ JAS JMS JST KOO KYCEM L7B LJTGL LU7 M0P M4Z O9- OK1 P2P RIG RNANH ROSJB RTWRZ TAE TASJS TBQAZ TDBHL TEJ TFL TFT TFW TN5 TTHFI TUROJ UKR UPT USG WH7 XKC YZZ ZCA ZGOLN AQTUD JQ2 |
| ID | FETCH-LOGICAL-c231t-30e23af1ac3865982e76386bbbd4228b937f1ac7a4bf188c26f68fdbf26e620a3 |
| ISICitedReferencesCount | 0 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001524720500001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0002-9890 |
| IngestDate | Thu Nov 13 04:29:48 EST 2025 Sat Nov 29 07:21:30 EST 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 8 |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c231t-30e23af1ac3865982e76386bbbd4228b937f1ac7a4bf188c26f68fdbf26e620a3 |
| Notes | SourceType-Scholarly Journals-1 ObjectType-News-1 content type line 14 |
| ORCID | 0000-0002-1547-4925 |
| PQID | 3271107451 |
| PQPubID | 47349 |
| PageCount | 1 |
| ParticipantIDs | proquest_journals_3271107451 crossref_primary_10_1080_00029890_2025_2491975 |
| PublicationCentury | 2000 |
| PublicationDate | 2025-09-14 |
| PublicationDateYYYYMMDD | 2025-09-14 |
| PublicationDate_xml | – month: 09 year: 2025 text: 2025-09-14 day: 14 |
| PublicationDecade | 2020 |
| PublicationPlace | Washington |
| PublicationPlace_xml | – name: Washington |
| PublicationTitle | The American mathematical monthly |
| PublicationYear | 2025 |
| Publisher | Taylor & Francis Ltd |
| Publisher_xml | – name: Taylor & Francis Ltd |
| References | e_1_3_2_2_1 e_1_3_2_3_1 |
| References_xml | – ident: e_1_3_2_3_1 – ident: e_1_3_2_2_1 doi: 10.1007/978-3-0348-0237-6 |
| SSID | ssj0000542 |
| Score | 2.3812175 |
| Snippet | The Tower of Hanoi puzzle, traditionally solved with light disks, presents unique challenges when using heavy disks. This study focuses on minimizing the total... |
| SourceID | proquest crossref |
| SourceType | Aggregation Database Index Database |
| StartPage | 806 |
| SubjectTerms | Disks Numbers Puzzles Recursive algorithms |
| Title | Solving the Tower of Hanoi Puzzle with Heavy Disks |
| URI | https://www.proquest.com/docview/3271107451 |
| Volume | 132 |
| WOSCitedRecordID | wos001524720500001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVAWR databaseName: Taylor & Francis Online Journals customDbUrl: eissn: 1930-0972 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000542 issn: 0002-9890 databaseCode: TFW dateStart: 18940101 isFulltext: true titleUrlDefault: https://www.tandfonline.com providerName: Taylor & Francis |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1LT9wwELYK7QEOiD4QlId84Iayip2Xc6wQKw6AkJpSbpHtOCpiSVZkd0X59Z2x89htqwoOvVhZrzLK5svOKzPfEHIspIyCxC88EwXKC2H1VKCVV5a-BP8_1LF9e35zkVxdidvb9Lqdd9_YcQJJVYmnp3T6X6GGPQAbW2dfAXcvFDbgGECHFWCH9UXAf60ni64HKsMZaDZXL6v67uR6_vw8MS73em7k4ieSb943yw5qNnSaVCcPPacr9pjU1ezHUPw5hhjb5ZTNRC7nDniEhQ6uZ3NJH6bCDewcGacC08D3kNRnRUcOSch5V2TrNJ7w42Xj6T79oZf7QkYkfPdHeC0jCPxY6samrPJg_2af-qpB1tOZOjE5islbMWvkLU-iFKv6svH3wRhHIe8iIDyna-JCevW_Xc2qe7Jqna3LkW2TrTZWoF8cxu_JG1N9IJuXPSjNR8JbtCnsUYs2rUtq0aYObYpoU4s2tWh_It_GZ9npudeOwfA0ON8zL_AND2TJpMb5rKngBmyCiJVSBfK3KXAw8ctEhqpkQmgel7EoC1Xy2MTcl8EOWa_qyuwSmqhCacakEZqFhSikglN0CkGDZCoK4z0y6n59PnVsJ_k_7_oeOejuUd7-B5o84AlmFcKIfX6tvH2yMTynB2R99jg3h-SdXszumscjC-0va9FQDA |
| linkProvider | Taylor & Francis |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Solving+the+Tower+of+Hanoi+Puzzle+with+Heavy+Disks&rft.jtitle=The+American+mathematical+monthly&rft.au=Fried%2C+Sela&rft.date=2025-09-14&rft.issn=0002-9890&rft.eissn=1930-0972&rft.volume=132&rft.issue=8&rft.spage=806&rft.epage=806&rft_id=info:doi/10.1080%2F00029890.2025.2491975&rft.externalDBID=n%2Fa&rft.externalDocID=10_1080_00029890_2025_2491975 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0002-9890&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0002-9890&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0002-9890&client=summon |