In this puzzle, three poles are given and in one pole a set of disks with different size are given. These disks are arranged in such a way that a disk on top of another is always smaller than the previous one.
Objective of this puzzle is to move all the disks to another pole with two important constraints. The constraints are:
- only one disk can move at a time and
- a larger disk cannot be placed on top of smaller one.
Implementation of the Tower of Hanoi problem
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
#include <stdio.h>
void towers(int num, char from, char to, char aux);
int main()
{
int num;
printf("Enter the number of disks : ");
scanf("%d", &num);
printf("The moves involved in the ToH are :\n");
towers(num, 'A', 'C', 'B');
return 0;
}
void towers(int num, char from, char to, char aux)
{
if (num == 1)
{
printf("\n Move disk 1 from %c to %c", from, to);
return;
}
towers(num - 1, from, aux, to);
printf("\n Move disk %d from %c to %c", num, from, to);
towers(num - 1, aux, to, from);
}
Posts
No comments:
Post a Comment
Note: Only a member of this blog may post a comment.