This is a Python program to implement Tower of Hanoi.

The program prompts the user for the number of disks n and the program prints the procedure to move n disks from peg A to peg C using peg B.

1. Create function hanoi that takes the number of disks n and the names of the source, auxiliary and target pegs as arguments.

2. The base case is when the number of disks is 1, in which case simply move the one disk from source to target and return.

3. Move n – 1 disks from source peg to auxiliary peg using the target peg as the auxiliary.

4. Move the one remaining disk on the source to the target.

5. Move the n – 1 disks on the auxiliary peg to the target peg using the source peg as the auxiliary.

Here is the source code of a Python program to implement Tower of Hanoi. The program output is shown below.

def hanoi(disks, source, auxiliary, target): if disks == 1: print('Move disk 1 from peg {} to peg {}.'.format(source, target)) return hanoi(disks - 1, source, target, auxiliary) print('Move disk {} from peg {} to peg {}.'.format(disks, source, target)) hanoi(disks - 1, auxiliary, source, target) disks = int(input('Enter number of disks: ')) hanoi(disks, 'A', 'B', 'C')

1. The user is prompted for the number of disks n.

2. The function hanoi is called on n with names of the source, auxiliary and target pegs as A, B and C respectively.

Case 1: Enter number of disks: 4 Move disk 1 from peg A to peg B. Move disk 2 from peg A to peg C. Move disk 1 from peg B to peg C. Move disk 3 from peg A to peg B. Move disk 1 from peg C to peg A. Move disk 2 from peg C to peg B. Move disk 1 from peg A to peg B. Move disk 4 from peg A to peg C. Move disk 1 from peg B to peg C. Move disk 2 from peg B to peg A. Move disk 1 from peg C to peg A. Move disk 3 from peg B to peg C. Move disk 1 from peg A to peg B. Move disk 2 from peg A to peg C. Move disk 1 from peg B to peg C. Case 2: Enter number of disks: 2 Move disk 1 from peg A to peg B. Move disk 2 from peg A to peg C. Move disk 1 from peg B to peg C. Case 3: Enter number of disks: 1 Move disk 1 from peg A to peg C.

**Sanfoundry Global Education & Learning Series – Python Programs.**

To practice all Python programs, __here is complete set of 150+ Python Problems and Solutions__.