The problem is to move all the disk from source to destination by the help of Via . A few rules to be followed for Tower of Hanoi are −
- 1) Only one disk can be moved among the towers at any given time.
- 2) Only the “top” disk can be removed.
- 3) No large disk can sit over a small disk.
// function for move the disk
void move(int n,char s,char d,char v)
printf(“n move from %c to %c”,s,d);
printf(“Enter nuber of disk”);