Scribd
Upload
87 views4 pages

Q.1.Implementation of Tower of Hanoi Using Stack Input

This C program implements the Tower of Hanoi puzzle using stacks. It defines a Stack struct to represent stacks with a capacity, top pointer, and array. Functions are created to initialize stacks, check if full/empty, and push/pop elements. A moveDisk function prints moves. The tohIterative function takes stacks and number of disks as input, pushes disks to the source stack, and iteratively moves disks between stacks using moveDisksBetweenTwoPoles following the Tower of Hanoi algorithm. It is tested with 3 disks and outputs the required 7 moves.

Uploaded by

Kaustubh Patil
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
87 views4 pages

Q.1.Implementation of Tower of Hanoi Using Stack Input

This C program implements the Tower of Hanoi puzzle using stacks. It defines a Stack struct to represent stacks with a capacity, top pointer, and array. Functions are created to initialize stacks, check if full/empty, and push/pop elements. A moveDisk function prints moves. The tohIterative function takes stacks and number of disks as input, pushes disks to the source stack, and iteratively moves disks between stacks using moveDisksBetweenTwoPoles following the Tower of Hanoi algorithm. It is tested with 3 disks and outputs the required 7 moves.

Uploaded by

Kaustubh Patil
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

Q.1.

Implementation of Tower of Hanoi using Stack


INPUT
#include <stdio.h>
#include <math.h>
#include <stdlib.h>
#include <limits.h>

struct Stack
{
unsigned capacity;
int top;
int *array;
};

struct Stack* createStack(unsigned capacity)


{
struct Stack* stack =
(struct Stack*) malloc(sizeof(struct Stack));
stack -> capacity = capacity;
stack -> top = -1;
stack -> array =
(int*) malloc(stack -> capacity * sizeof(int));
return stack;
}

int isFull(struct Stack* stack)


{
return (stack->top == stack->capacity - 1);
}

int isEmpty(struct Stack* stack)


{
return (stack->top == -1);
}

void push(struct Stack *stack, int item)


{
if (isFull(stack))
return;
stack -> array[++stack -> top] = item;
}

int pop(struct Stack* stack)


{
if (isEmpty(stack))
return INT_MIN;
return stack -> array[stack -> top--];
}

void moveDisk(char fromPeg, char toPeg, int disk)


{
printf("Move the disk %d from \'%c\' to \'%c\'\n",
disk, fromPeg, toPeg);
}

void moveDisksBetweenTwoPoles(struct Stack *src,


struct Stack *dest, char s, char d)
{
int pole1TopDisk = pop(src);
int pole2TopDisk = pop(dest);

if (pole1TopDisk == INT_MIN)
{
push(src, pole2TopDisk);
moveDisk(d, s, pole2TopDisk);
}

else if (pole2TopDisk == INT_MIN)


{
push(dest, pole1TopDisk);
moveDisk(s, d, pole1TopDisk);
}

else if (pole1TopDisk > pole2TopDisk)


{
push(src, pole1TopDisk);
push(src, pole2TopDisk);
moveDisk(d, s, pole2TopDisk);
}
else
{
push(dest, pole2TopDisk);
push(dest, pole1TopDisk);
moveDisk(s, d, pole1TopDisk);
}
}

void tohIterative(int num_of_disks, struct Stack


*src, struct Stack *aux,
struct Stack *dest)
{
int i, total_num_of_moves;
char s = 'S', d = 'D', a = 'A';

if (num_of_disks % 2 == 0)
{
char temp = d;
d = a;
a = temp;
}
total_num_of_moves = pow(2, num_of_disks) - 1;

for (i = num_of_disks; i >= 1; i--)


push(src, i);

for (i = 1; i <= total_num_of_moves; i++)


{
if (i % 3 == 1)
moveDisksBetweenTwoPoles(src, dest, s, d);

else if (i % 3 == 2)
moveDisksBetweenTwoPoles(src, aux, s, a);

else if (i % 3 == 0)
moveDisksBetweenTwoPoles(aux, dest, a, d);
}
}

int main()
{
unsigned num_of_disks = 3;

struct Stack *src, *dest, *aux;

src = createStack(num_of_disks);
aux = createStack(num_of_disks);
dest = createStack(num_of_disks);

tohIterative(num_of_disks, src, aux, dest);


return 0;
}

OUTPUT
C:\Users\KAUSTUBH\Desktop>gcc -o hanoi hanoi.c

C:\Users\KAUSTUBH\Desktop>hanoi
Move the disk 1 from 'S' to 'D'
Move the disk 2 from 'S' to 'A'
Move the disk 1 from 'D' to 'A'
Move the disk 3 from 'S' to 'D'
Move the disk 1 from 'A' to 'S'
Move the disk 2 from 'A' to 'D'
Move the disk 1 from 'S' to 'D'

You might also like