A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Several Bounds for the K-Tower of Hanoi Puzzle
2017
Recreational Mathematics Magazine
Preserved Fulltext
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:10.1515/rmm-2017-0015
fatcat:qsewh2lswjdjxj2y4cel523xkm