The document describes an implementation of the Towers of Hanoi problem in C. It includes a TowerMove class to represent individual disk moves, a Tower class to represent the towers, and a solveTower method to recursively solve the problem and return a list of required moves. It also provides sample code showing how to initialize the problem for 3 disks and print out the resulting list of moves.

1. /* DO NOT CHANGE THE CODE BELOW HERE */
/* IT MUST BE INCLUDED AS PART OF YOUR SUBMISSION */
class TowerMove
{
int disk;
String from;
String to;
public TowerMove(int d, String f, String t)
{
disk = d;
from =f;
to = t;
}
@Override
public String toString()
{
return String.format("move %d from %s to %s", disk, from, to);
}
@Override
public boolean equals(Object other)
{
if ( ! (other instanceof TowerMove) ) return false;
TowerMove tst = (TowerMove) other;
if (disk == tst.disk && from == tst.from && to == tst.to)
return true;
return false;
}
}
14.10 ZYLAB Towers of Hanoi You are to write a solution to the Towers of Hanoi Constructor
public Tower (int ndisks) ndisks number of disks in the tower. The smallest disk is '1', the
largest is 'ndisks' Recursive Solver Array List TowerMove solve Tower String src, String aux,
String dst) src name of the source tower where disks start aux name of the auxiliary Tower dst
name of the destination tower. Where disks should complete return: a list of moves to solve the
tower. See code Template provided Requirements Do not modify the definition of TowerMove.
Example Tower myT new Tower (3) for Array List TowerMove move myT. solveTower alpha
beta. "gamma System. out. println(move) Should give the results more 1 from alpha to gamma
more 2 from alpha to beta more 1 from gamma to beta move 3 from alpha to gamma more 1
from beta to alpha more 2 from beta to gamma more 1 from alpha to gamma

2. Solution
#include <stdio.h>
void towers(int, char, char, char);
int main()
{
int num;
printf("Enter the number of disks : ");
scanf("%d", &num);
printf("The sequence of moves involved in the Tower of Hanoi are : ");
towers(num, 'A', 'C', 'B');
return 0;
}
void towers(int num, char alpha, char gamma, char beta)
{
if (num == 1)
{
printf(" Move disk 1 from alpha %c gamma %c", alpha, gamma);
return;
}
towers(num - 1, alpha, beta, gamma);
printf(" Move disk %d alpha %c gamma %c", num, alpha, gamma);
towers(num - 1, beta, gamma, alpha);
}