## EXPLORATION 1 Winning the Game One thing that the Tower of Hanoi Solution does not…
MATHEMATICS · Subjective · CBSE · Mathematics · Sequences and Series · Sequences and Series
Problem
## EXPLORATION 1 Winning the Game
One thing that the Tower of Hanoi Solution does not settle is how to get the stack to finish on the rightmost peg rather than the middle peg. Predictably, it depends on where you move the first washer, but it also depends on the height of the stack. Using a Web site game, or coins of different sizes, or even the real game if you have one, play the game with 1 washer, then 2 , then 3 , then 4 , and so on, keeping track of what your first move must be in order to have the stack wind up on the rightmost peg in 2n−1 moves. What is the general rule for a stack of n washers?