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.