The Tower of Hanoi game is a classical puzzle in recreational mathematics, which also has a strong record in pure mathematics. In a borderland between these two areas we find the characterization of the minimal number of moves, which is 2n−1, to transfer a tower of n disks. But there are also other variations to the game, involving for example move edges weighted by real numbers. This gives ris...
