Tower of Hanoi Solver
Show the optimal Tower-of-Hanoi move sequence for N disks.
15
Optimal moves
1. Disk 1: A → B
2. Disk 2: A → C
3. Disk 1: B → C
4. Disk 3: A → B
5. Disk 1: C → A
6. Disk 2: C → B
7. Disk 1: A → B
8. Disk 4: A → C
9. Disk 1: B → C
10. Disk 2: B → A
11. Disk 1: C → A
12. Disk 3: B → C
13. Disk 1: A → B
14. Disk 2: A → C
15. Disk 1: B → CAbout this tool
Enter the number of disks (1–15) and the tool emits the optimal 2ⁿ−1 move sequence to relocate the tower from pole A to pole C using pole B.