The Broncho Tower: A Modification of the Tower of Hanoi Puzzle

Authors

Stephen B. Gregg, University of Central OklahomaFollow
Juan Orozco, University of Central OklahomaFollow

Abstract

We explore ways to find an upper bound on the minimum number of moves to complete a modified version of the Tower of Hanoi puzzle. First, we demonstrate how a simpler modification's minimum number of moves can be obtained using Difference Equations. Next, we show how our modified puzzle differs and how we can apply the same techniques to our puzzle.

Author Bio

Stephen B. Gregg is finishing a bachelor's degree in Mathematics at the University of Central Oklahoma. Afterward, he plans to begin his career while also pursuing higher education.

Faculty Sponsor

Britney Hopkins, Kristi Karber, Thomas Milligan

Recommended Citation

Gregg, Stephen B. and Orozco, Juan (2013) "The Broncho Tower: A Modification of the Tower of Hanoi Puzzle," Rose-Hulman Undergraduate Mathematics Journal: Vol. 14: Iss. 2, Article 3.
Available at: https://scholar.rose-hulman.edu/rhumj/vol14/iss2/3