Deitel C++ How To Program 9th Edition Chapter 6 Exercise 6.38

Write a program which demonstrate tower of Hanoi movement of 3 disks from peg [1 to 3] using recursive method.

Terminal

1 ->> 2
1 -.> 3
2 ->> 3
1 -.> 2
3 ->> 1
3 -.> 2
1 ->> 2
1 -.> 3
2 ->> 3
2 -.> 1
3 ->> 1
2 -.> 3
1 ->> 2
1 -.> 3
2 ->> 3

Solution

#include <iostream>

using namespace  std;

void towerOfHanoi(int n, int source, int dest, int temp);  // n is the number if disk  souce is pole 1, destination 3, temporary is pole 2

int main() {
  towerOfHanoi(4,1,3,2);
  return -1;
}

void towerOfHanoi(int n, int source, int dest, int temp) {
  if (n == 1) {
    cout << source << " ->> " <<  dest << endl;
    return;
  }
  towerOfHanoi(n - 1, source, temp, dest);  // move from pole 1 to pole 2
  cout << source << " -.> " <<  dest << endl;
  towerOfHanoi(n - 1, temp, dest, source);  // move from pole 2 to pole 3
}