Tower of Hanoi

Hard Recursion

Solve in Playground →

Problem Statement

Write a recursive Python program to solve Tower of Hanoi for N disks, printing move instructions in the format `Move disk {d} from {source} to {dest}`.

Input Format

An integer N representing number of disks.

Output Format

Print move steps line by line.

Constraints

1 <= N <= 5

Sample Input

Sample Output

Move disk 1 from A to B
Move disk 2 from A to C
Move disk 1 from B to C

Explanation

Move n-1 disks from source to auxiliary, move nth disk to destination, then move n-1 disks from auxiliary to destination.

Starter Code

def hanoi(n, source, dest, aux):
    # Write your code here
    pass

n = int(input())
hanoi(n, 'A', 'C', 'B')

Limits

Time Limit: 1s
Memory Limit: 256MB

Start Coding in IDE →