C Program to create a solution to the Towers of Hanoi game

C Program to create a solution to the Towers of Hanoi game

How to write a C Program to create a solution to the Towers of Hanoi game in C Programming Language ?


Solution:

  1. /* Program to create a solution to the Towers of Hanoi game*/


  3. #include <stdio.h>
  5. void SparePegAssign(int, int, int&);
  6. void TowerSolver(int, int, int, int);
  8. int main()
  9. {
  10.     int disk, fromPeg, toPeg, sparePeg = 1;
  12.     printf("Enter the number of disks you want to move: ");
  13.     scanf("%d", &disk);
  14.     printf("From which peg: ");
  15.     scanf("%d", &fromPeg);
  16.     printf("To which peg: ");
  17.     scanf("%d,", &toPeg);
  19.     SparePegAssign(fromPeg, toPeg, sparePeg);
  21.     printf("The sequence of moves involved in the Tower of Hanoi are : ");
  22.     TowerSolver(disk, fromPeg, toPeg, sparePeg);
  23.     return 0;
  24. }
  26. // Recursion function,
  27. void TowerSolver(int ldisk, int lfromPeg, int lnewPeg, int lsparePeg)
  28. {
  29.     if (ldisk == 1) { // If statement to determine if it will be the final move.
  30.         printf("\n Move a disk from peg %d to peg %d", lfromPeg, lnewPeg);
  31.         return;
  32.     }
  33.     else { // Used to the move the disks until ldisk results in a 1.
  34.         TowerSolver (ldisk - 1, lfromPeg, lsparePeg, lnewPeg);
  35.         printf("\n Move a disk from peg %d to peg %d", lfromPeg, lnewPeg);
  36.         TowerSolver(ldisk - 1, lsparePeg, lnewPeg, lfromPeg);
  37.     }
  38. }
  41. /* Function put in place to determine what the value of the spare peg will be.
  42.  * It does this by taking the sum of the other pegs
  43.  */
  44. void SparePegAssign (int lfromPeg, int ltoPeg, int& lsparePeg) {
  45.     if ((lfromPeg + ltoPeg) == 3)
  46.         lsparePeg = 3;
  47.     else if ((lfromPeg + ltoPeg) == 4)
  48.         lsparePeg = 2;
  49.     else
  50.         lsparePeg = 1;
  52.     return;
  53. }


Learn More :

Learn More Multiple Choice Question :