The Towers of Hanoi Problem
Towers of Hanoi problem is described. There are three pegs on which disks are "threaded" (there are holes in the disks to allow them to be placed on the pegs). No two disks have the same size and one can never place a larger disk stop a smaller disk. Only one disk can be moved at a time (and when a disk is not being move, it must be on one of the pegs). The problems starts with all the disks on one peg and the goal is to move them all to one other peg.
Write a program that solves the Towers of Hanoi problem. However, we want to make some minor changes to the speci?cation provided in the textbook.
Instead of numbering the pegs 1, 2, and 3, number them 0, 1, and 2. You code should start with all the disk on peg 0 and the goal is to move them all to peg 2.
Call the function you write to solve the problem hanoi(). This is a void function. Instead of four parameters (as described in the textbook), the function should take ?ve parameters as follows:
1. The total number of disks on all the pegs.
2. The number of disks to be moved.
3. The peg on which the disks are initially threaded (i.e., the "source" peg).
4. The peg to which these disks are to be moved (i.e., the "destination" peg).
5. The peg to use as a temporary holding peg.
Note that parameters 2 through 5 in the list above are the same as the parameters 1 through 4 as described in the textbook. The only new parameter is the ?rst one and, once initially set, this parameter will not change throughout the remainder of the execution of the program though not necessary for the solution of this problem, the reason for including this parameter will be more clear in the next problem.