C LANGUAGE

Tower of Hanoi Problem: This is an interesting problem of recursion. Tower of Hanoi problem is to move the Disks on the Source Tower to the Destination Tower. But, you should ensure that the Disks on the Destination Tower should be in the same format as in the Source Tower i.e., the Largest Disk should be at the Bottom Position and the Smallest Disk should be at the Top Position. In other words, a Larger Disk should not be kept on Top of a Smaller Disk. To move these Disks, you can make use of a Temporary Tower , also called as an Auxiliary Tower. A Tower is also frequently called as Peg. So in short, Conditions For Towers of Hanoi Algorithm: a. Larger Disk cannot be placed on Smaller Disks b. We can shift only One Disk at a time from One Tower to another.