Open Access

Several Bounds for the K-Tower of Hanoi Puzzle

Stephen B. Gregg

Stephen B. Gregg

University of Central Oklahoma,Oklahoma, Unied States of America
Search for this author on
Sciendo|Google Scholar
Gregg, Stephen B.
, 
Britney Hopkins

Britney Hopkins

University of Central Oklahoma,Oklahoma, Unied States of America
Search for this author on
Sciendo|Google Scholar
Hopkins, Britney
, 
Kristi Karber

Kristi Karber

University of Central Oklahoma,Oklahoma, Unied States of America
Search for this author on
Sciendo|Google Scholar
Karber, Kristi
, 
Thomas Milligan

Thomas Milligan

University of Central Oklahoma,Oklahoma, Unied States of America
Search for this author on
Sciendo|Google Scholar
Milligan, Thomas
 and 
Johnny Sharp

Johnny Sharp

University of Central Oklahoma,Oklahoma, Unied States of America
Search for this author on
Sciendo|Google Scholar
Sharp, Johnny
  
Jun 09, 2017
Several Bounds for the K-Tower of Hanoi Puzzle's Cover Image
About this article
Previous Article
Next Article
Cite
Download Cover
Article Category: Games and Puzzles
Published Online: Jun 09, 2017
Page range: 79 - 118
DOI: https://doi.org/10.1515/rmm-2017-0015
Keywords
© 2017
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

We consider special cases of a modified version of the Tower of Hanoi puzzle and demonstrate how to find upper bounds on the minimum number of moves that it takes to complete these cases.

Language:
English
Publication timeframe:
2 times per year
Journal Subjects:
Mathematics, General Mathematics
Journal RSS Feed