Several Bounds for the K-Tower of Hanoi Puzzle
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.
DOI: https://doi.org/10.1515/rmm-2017-0015 | Journal eISSN: 2182-1976
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:
Related subjects:
© 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.