An iterative solution to the Tower of Hanoi problem. The program prints out a list of moves to solve a Tower of Hanoi with an inputted number of rings. The solution is written to a text file.
To change the number of disks, simply change the input in the main.cpp file.