Several Bounds for the K-Tower of Hanoi Puzzle

Gregg, Stephen B.; Hopkins, Britney; Karber, Kristi; Milligan, Thomas; Sharp, Johnny

doi:10.1515/rmm-2017-0015

.blurhash-client-img { display: none !important; }

Several Bounds for the K-Tower of Hanoi Puzzle

Recreational Mathematics Magazine

Volume 4 (2017): Issue 7 (May 2017)

By: Stephen B. Gregg, Britney Hopkins, Kristi Karber, Thomas Milligan and Johnny Sharp

Open Access

|Jun 2017

Abstract

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.

References

[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.
Search in Google Scholar Back to article
[2] “The Tower of Stanford”, Problems and Solutions, American Mathematical Monthly, 111, no. 4, 364-365, April 2004.10.2307/4145258
Search in Google Scholar Back to article

DOI: https://doi.org/10.1515/rmm-2017-0015 | Journal eISSN: 2182-1976

Journal RSS Feed

Language: English

Page range: 79 - 118

Published on: Jun 9, 2017

Published by: Ludus Association

In partnership with: Paradigm Publishing Services

Publication frequency: 2 issues per year

Keywords:

Tower of Hanoi Puzzle,

minimum number of moves

Related subjects:

Mathematics,

General mathematics

© 2017 Stephen B. Gregg, Britney Hopkins, Kristi Karber, Thomas Milligan, Johnny Sharp, published by Ludus Association
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

Volume 4 (2017): Issue 7 (May 2017)Next article