# Tower Of Hanoi

Posted on July 13, 2014 by Shivaji Varma

The Tower of Hanoi (also called the Tower of Brahma or Lucas' Tower) is a mathematical game or puzzle. It consists of three rods, and a number of disks of different sizes which can slide onto any rod. The puzzle starts with the disks in a neat stack in ascending order of size on one rod, the smallest at the top, thus making a conical shape.

The objective of the puzzle is to move the entire stack to another rod, obeying the following rules:

- Only one disk may be moved at a time.
- Each move consists of taking the upper disk from one of the rods and sliding it onto another rod, on top of the other disks that may already be present on that rod.
- No disk may be placed on top of a smaller disk.

### Code

```
#include<stdio.h>
void towhan(int n,char x,char y,char z)
{
if(n <= 1)
{
towhan(n-1,x,z,y);
printf("\nMOVE TOP DISK FROM TOWER '%c' TO TOP OF TOWER '%c' \n",x,y);
towhan(n-1,z,y,x);
}
}
int main()
{
int n;
printf("ENTER THE NUMBER OF DISKS");
scanf("%d",&n);
towhan(n,'A','B','C');
getch();
return 0;
}
```

This website is made possible by displaying online advertisements to our visitors.

Please consider supporting by disabling your ad blocker.

Please consider supporting by disabling your ad blocker.