Also, while I know it looks really simple, and perhaps this robot is a tad slow, it’s important to remember that the minimum number of moves to solve any Tower of Hanoi puzzle is 2 n - 1 (so, in ...