Tower of Hanoi

Program in c++ to solve Tower of Hanoi using recursion.

Program:-

#include<iostream.h>

#include<conio.h>

main()

{

  void tower(int,char,char,char);

  int n;

  clrscr();

  cout<<"\ Enter how many disk..";

  cin>>n;

  tower(n,'i','j','k');

  getch();

}

void tower(int n,char A,char B,char C)

{

  if(n==1)

  {

     cout<<"\n Move disk 1 from peg"<<A<<"to peg"<<C;

     return;

  }

  tower(n-1,A,C,B);

  cout<<"\n Move disk"<<n<<"from peg"<<A<<"to peg"<<C;

  tower(n-1,A,B,C);

  return;

}

 

 

 

Output:

 

 Enter how many disk..3

                                                                               

 Move disk 1 from pegito pegk                                                  

 Move disk 2 from pegito pegj

 Move disk 1 from pegito pegj                                                   

 Move disk 3 from pegito pegk

 Move disk 1 from pegito pegj                                                  

 Move disk 2 from pegito pegk

 Move disk 1 from pegito pegk    */