Chapter 3, Problem 12C

Explanation of Solution

Procedure:

• To write an algorithm for Tower of Hanoi, first consider problem with lesser amount of disks that is one or two disk.
• There are three towers with name, source, destination and aux.
• If only one disk, then it can easily be moved from source to destination peg.
• If there are two disks, first, move the smaller (top) disk to aux peg. Then, move the larger (bottom) disk to destination peg. And finally, move the smaller disk from aux to destination peg.
• So now, to design an algorithm for Tower of Hanoi with more than two disks, divide the stack of disks in two parts. The largest disk (nth disk) is in one part and all other (n-1) disks are in the second part.
• To move disk n from source to destination and then put all other (n1) disks onto it. Recursive way for all given set of disks will be as below:

The steps to follow are:

Step 1 : Move n-1 disks from source to “aux”...