Code: #include <stdio.h> #include <conio.h> void diskchange(char l,char r,char c,int n) { if(n>0) { diskchange(l,c,r,n-1); printf("\nMove %d from %c to %c\n",n,l,r); diskchange(c,r,l,n-1); } } int main() { int n; printf("\nEnter the number of disks\n"); scanf("%d",&n); diskchange('L','R','C',n); printf("\nPress any key to exit\n"); getch(); return 0; }

The Tower of Hanoi is a mathematical game or puzzle which consists of three (n) pegs, and a number of discs of different sizes which can slot onto any peg. The puzzle starts with the discs neatly stacked in order of size on one peg, smallest at the top and moving them to the other peg using the third peg. Condition is at no move you will have the larger peg over the smaller one.