Hi sir this is siva, i need on coding of towers of honoi problem in c language.The out will be like this.... it will show graphical movement of discs from one tower to another tower according to statements on screen. But with out using any graphical concepts with only c langauge concept .I need this very urgent can u help me .
Thanks for ur help.
The name is 'Hanoi', not 'Honoi'; the essence of the solution is this: suppose
you have three tower positions: 'A', 'B and C. If you are able to move a tower
containing n disks from position 'A to position B, you are also able to move it
from position A to position C, just change positions B and C along the way.
But then you are able to move a tower containing n+1 disks from position A to
position B: move the top n disks from A to C, move the largest disk from A to B
and finally move those n disks from position C to B on top of that largest disk.
Because all disks are smaller than that largest disk, that largest disk will never
block any move.
Of course you can move a tower containing zero disks from any position to any
other position. All the rest is complete induction.
kind regards,
Jos
1
