Move all disks from the first tower to the last tower
The Tower of Hanoi is a mathematical puzzle where you must move all disks from one rod to another, following these rules:
Minimum Moves: For n disks, the minimum number of moves required is 2ⁿ - 1
Algorithm: The solution uses recursion - to move n disks, move n-1 disks to the auxiliary rod, move the largest disk to the target, then move n-1 disks to the target.