Answer to Question #239035 in C++ for Nelly

Question

Towers of Hanoi: One of the most popular puzzle is called Towers of Hanoi . It consists
of three rods (or towers) with a specific number of disks with different sizes in one
rod, arranged in ascending order (from the top) from smallest to largest. The goal
is to move the stack of disks from the starting rod to any of the other two. But there
are certain rules to be followed. Firstly, place randomly disks in the towers
The rules of the puzzle are:
• 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.

Write C++ code for the above problem

Answer 1

#include <iostream>
using namespace std;
 //A recursive function that solve the puzzle of Towers of Hanoi
void towers_of_hanoi(int number_of_disks, string source_rod, string destination_rod, string auxiliary_rod)
{
    if (number_of_disks == 1)
    {
        cout << "Movement of disk 1 from rod " << source_rod << " to rod " << destination_rod<<endl;
        return;
    }
    towers_of_hanoi(number_of_disks - 1, source_rod, auxiliary_rod, destination_rod);
    cout << "Move disk " << number_of_disks << " from rod " << source_rod <<
                                " to rod " << destination_rod << endl;
    towers_of_hanoi(number_of_disks - 1, auxiliary_rod, destination_rod, source_rod);
}
 
// Testing code
int main()
{
    int number_of_disks = 4; // Total number of disks
    towers_of_hanoi(number_of_disks, "Rod A", "Rod C", "Rod B"); 
    return 0;
}