COP 3503
Homework

to be done with homework team

Implement Towers of Hanoi recursively. Work in your homework group - please try to solve on your own and then show each other code and discuss before ONE person in group submits source code. You do not need to supply a report, man page, or split the code into multiple files unless it makes sense to do so. A makefile is required with target "hanoi" that is the executable. When run, it should be self-evident how to use the program. 

Write code to solve the Towers of Hanoi problem for a size entered from cin.  This will allow the user to enter number of disks, N, which may be represented by integers from 1 to N, with N the largest disk and 1 the smallest. 

Your code must use recursion to solve the problem, and must have appropriate 
data structures to hold the contents of each tower. 

Start with all N disks on first tower, then move all N disks to the third tower, using the second tower as a spare, and obeying the Tower of Hanoi rules (one disk at a time, never have a larger disk on top of a smaller disk). 

Include a mode (may be set by flag in code) to display the contents of all three towers every time a disk is moved (see sample output).  Provide an option for the user to set the flag to display the state of the towers on each disk move. 

A sample output file has been provided in http://www.cise.ufl.edu/~nemo/cop3503/src/hanoi_output.txt. 

Time how long it takes to execute the code for various numbers of disks, and
graph this time vs. number of disks.