Write a Tower of Hanoi program by using Java recursion.

The following is a pseudo codes.

FUNCTION MoveTower(disk, source, dest, spare):

IF disk == 0, THEN:

move disk from source to dest

ELSE:

MoveTower(disk - 1, source, spare, dest) // Step 1 above

move disk from source to dest // Step 2 above

MoveTower(disk - 1, spare, dest, source) // Step 3 above

END IF

Example of execution of your program:

The number of disks : 3

Output:

Disk 1 moved from A to C

Disk 2 moved from A to B

Disk 1 moved from C to B

Disk 3 moved from A to C

Disk 1 moved from B to A

Disk 2 moved from B to C

Disk 1 moved from A to C

The total number of disk movements is 7.