JOURNAL ARTICLE

The weighted Tower of Hanoi.

  • Published In: Discrete Mathematics, Algorithms & Applications, 2024, v. 16, n. 5. P. 1 1 of 3

  • Database: Academic Search Ultimate 2 of 3

  • Authored By: Mehiri, El-Mehdi; Belbachir, Hacene 3 of 3

Abstract

The weighted Tower of Hanoi problem is a new generalization of the classical Tower of Hanoi problem, where a move of a disc between two pegs i and j is weighted by a positive real w i j . This new problem generalizes the concept of finding the minimum number of moves to solve the Tower of Hanoi, to find a sequence of moves with the minimum total weight. We present an optimal dynamic algorithm to solve the weighted Tower of Hanoi problem, as well as some of its properties. We also show the link of this generalization to the Tower of Hanoi variants with restricted disc moves, and how this new problem can generalize the concept of restricting a disc move. [ABSTRACT FROM AUTHOR]

Additional Information

  • Source:Discrete Mathematics, Algorithms & Applications. 2024/07, Vol. 16, Issue 5, p1
  • Document Type:Article
  • Subject Area:History
  • Publication Date:2024
  • ISSN:1793-8309
  • DOI:10.1142/S1793830923500519
  • Accession Number:177091150
  • Copyright Statement:Copyright of Discrete Mathematics, Algorithms & Applications is the property of World Scientific Publishing Company and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Looking to go deeper into this topic? Look for more articles on EBSCOhost.