꺶 Program functionality
This program solves the problem of the Tower of Hanoi. This shows the movements of disks.
꺶 Program design
Suppose there are three disks. According to the rule of the Tower of Hanoi, we need to move the disks from A to B and then from A to C then from B to C. At here, how can we move all disks from A to B? It is same problem. At first, move the disks from A to C then from A to B then from C to B. It is recursion. Moreover, the integer value indicates a depth of the movement.