Several Bounds for the K-Tower of Hanoi Puzzle

Open access

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.

[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.

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

Journal Information

Target Group

researchers in the fields of games and puzzles, problems, mathmagic, mathematics and arts, math and fun with algorithms

Metrics

All Time Past Year Past 30 Days
Abstract Views 0 0 0
Full Text Views 62 62 23
PDF Downloads 21 21 12