Jump to ContentJump to Main Navigation
Show Summary Details
More options …

Recreational Mathematics Magazine

2 Issues per year

Mathematical Citation Quotient (MCQ) 2016: 0.05

Open Access
See all formats and pricing
More options …

Several Bounds for the K-Tower of Hanoi Puzzle

Stephen B. Gregg / Britney Hopkins / Kristi Karber / Thomas Milligan / Johnny Sharp
Published Online: 2017-06-09 | DOI: https://doi.org/10.1515/rmm-2017-0015


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.

Keywords: Tower of Hanoi Puzzle; minimum number of moves


  • [1] Gregg, S.B., Orozco, J. “The Broncho Tower a modification of the Tower of Hanoi puzzle”, Rose-Hulman Undergrad. Math. J., 4, no. 2, 47-58, 2013.Google Scholar

  • [2] “The Tower of Stanford”, Problems and Solutions, American Mathematical Monthly, 111, no. 4, 364-365, April 2004.Google Scholar

About the article

Published Online: 2017-06-09

Published in Print: 2017-05-24

Citation Information: Recreational Mathematics Magazine, Volume 4, Issue 7, Pages 79–118, ISSN (Online) 2182-1976, DOI: https://doi.org/10.1515/rmm-2017-0015.

Export Citation

© 2017. This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License. BY-NC-ND 4.0

Comments (0)

Please log in or register to comment.
Log in