Chapter 3, Problem 8P

Explanation of Solution

Program code:

//include the required header files

#include<iostream>

//use the namespace std

using namespace std;

//tower of HANOI function implementation

void TOH(int n,char Sour, char Aux,char Des)

{

//if the value of n is equal to 1

if(n==1)

{

//print the moves

cout<<"Move Disk "<<n<<" from "<<Sour<<" to "<<Des<<endl;

return;

}

//call the function TOH()

TOH(n-1,Sour,Des,Aux);

//print the moves

cout<<"Move Disk "<<n<<" from "<<Sour<<" to "<<Des<<endl;

//call the function TOH()

TOH(n-1,Aux,Sour,Des);

}

//main function

int main()

{

//declare the integer variable

int n;

//prompt the user to enter the number of disk

cout<<"Enter no...