Tower of Hanoi
Mediumjavapythonccppjavascript
Solve the Tower of Hanoi for N disks using three rods named A, B and C. Move all disks from rod A to rod C, never placing a larger disk on a smaller one.
Input Format
A single line containing the integer N.
Output Format
Print the sequence of moves, one per line, each as X -> Y meaning "move the top disk from rod X to rod Y".
Example 1
Input
2
Output
A -> B A -> C B -> C
Explanation: Two disks require three moves.
- 1 <= N <= 12
Submit an attempt to unlock the solution. (Sign in first.)
Related Problems
- Generate All SubsetsMedium · java, python, c, cpp, javascriptSolve Problem
- Generate All PermutationsMedium · java, python, c, cpp, javascriptSolve Problem
- Rat in a MazeMedium · java, python, c, cpp, javascriptSolve Problem