208 citations · 360 across the 7 of their papers we have counts for
1 paper · 1 filter
Max A. Alekseyev, Toby Berger
We prove the exact formulae for the expected number of moves to solve several variants of the Tower of Hanoi puzzle with 3 pegs and n disks, when each move is chosen uniformly rand…