Lab Program 5b Tower of Hanoi 15CSL38 Data Structures in C Lab

Lab Program 5b:

5b. Solving Tower of Hanoi problem with n disks 
(using recursion)

#include<stdio.h>

#include<math.h>

void tower(int n, char from_peg,  char aux_peg, char to_peg);

void main()

{

                int n;

                printf("\nEnter the number of disks: ");

                scanf("%d", &n);

                tower(n, 'A', 'B', 'C');                                         // A-> from_peg B->aux_peg C->to_peg

    printf("\nTotal number of moves = %0.0f", pow(2,n)-1 );

}

void tower(int n, char from_peg,  char aux_peg, char to_peg)    

// A-> from_peg B->aux_peg C->to_peg

{

                if(n == 1)

                {

                                printf("\nMove disk %d from %c peg to %c peg", n,  from_peg,  to_peg);

                                return;

                }

                // move n-1 disks from A(from_peg) to B(to_peg) using C(aux_peg) as auxiliary

                tower(n-1, from_peg,  to_peg,  aux_peg); 

                printf("\nMove disk %d from peg %c to %c peg", n, from_peg,  to_peg);

                // move n-1 disks from B(aux_peg) to C(to_peg) using A(from_peg) as auxiliary

                tower(n-1, aux_peg, from_peg, to_peg);

}

Output:

Enter the number of disks: 3

Move disk 1 from A peg to C peg

Move disk 2 from peg A to B peg

Move disk 1 from C peg to B peg

Move disk 3 from peg A to C peg

Move disk 1 from B peg to A peg

Move disk 2 from peg B to C peg

Move disk 1 from A peg to C peg

Total number of moves  = 7


Also Credits to: 
Manoj Taleka  (manoj89biet@gmail.com)

Yashaswini Jogi (jogi.yash@gmail.com)