The actual process is programmatically fairly simple. We’ve already seen recursive algorithms in with examples like the quick sort and the merge sort, so that’s not a big issue.
void tower(int a,char from,char aux,char to){
if(a==1){
cout<<"\t\tMove disc 1 from "<<from<<" to "<<to<<"\n";
return;
}
else{
tower(a-1,from,to,aux);
cout<<"\t\tMove disc "<<a<<" from "<<from<<" to "<<to<<"\n";
tower(a-1,aux,from,to);
}
}
int main(){
int n;
cout<<"\n\t\t*****Tower of Hanoi*****\n";
cout<<"\t\tEnter number of discs : ";
cin>>n;
cout<<"\n\n";
tower(n,'A','B','C');
return 0;
}
Solving the Tower of Hanoi Problem was originally found on Access 2 Learn
