Tower of Hanoi Solver
Enter the number of disks(a number should <=6):
Solve
Rule
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.
No disk may be placed on top of a disk that is smaller than it.
the process picture
