fixing the move print out order as it was incorrect

Author: thomas-martin-uf

src/cpp/TowerOfHanoi.cpp

@@ -12,18 +12,17 @@
 
     The objective of the puzzle is to move the entire stack to the last rod, obeying the following rules:
 
-        Only one disk may be moved at a time.
+    Only one disk may be moved at a time.
 
-        Each move consists of taking the upper disk from one of the stacks and placing it on top of another stack or on an empty rod.
+    Each move consists of taking the upper disk from one of the stacks and placing it on top of another stack or on an empty rod.
 
-        No disk may be placed on top of a disk that is smaller than it.
+    No disk may be placed on top of a disk that is smaller than it.
 
     With 3 disks, the puzzle can be solved in 7 moves.
 
     The minimal number of moves required to solve a Tower of Hanoi puzzle is 2^n − 1, where n is the number of disks.
 
-
- */
+*/
 
 #include <iostream>
 using std::cout;
@@ -39,13 +38,13 @@ size_t solve_tower(int n, char first, char second, char third)
     }
 
     // move n-1 disks from first to other using second as a placeholder
-    size_t num_moves = solve_tower(n - 1, first, second, third);
+    size_t num_moves = solve_tower(n - 1, first, third, second);
 
     // move the nth disk from first to second
-    cout << "Move disk " << n << " from " << first << " to " << second << "\n";
+    cout << "Move disk " << n << " from " << first << " to " << third << "\n";
 
     // move the n-1 disks from third to second using first as an placeholder
-    num_moves += solve_tower(n - 1, third, first, second);
+    num_moves += solve_tower(n - 1, second, first, third);
 
     // return the total moves plus 1
     return num_moves + 1;
@@ -60,7 +59,7 @@ int main()
     char c = 'C';
 
     // number of disks to move in puzzle
-    size_t num_disk = 4;
+    size_t num_disk = 3;
 
     // find the total number of moves needed to solve
     size_t num_moves = solve_tower(num_disk, a, b, c);