Tower of Hanoi: Optimal Move Formula & Strategy
Tower of Hanoi Rules
Move all disks from the left peg to the right peg. You can only move one disk at a time, and a larger disk can never be placed on top of a smaller disk.
Recursive Strategy
The minimum number of moves required to solve a tower of n disks is 2^n - 1. Move the smallest disk systematically to alternate pegs.