Just Programming...: Tower Of Hanoi - Non-recursive Approach

Just Programming...: Tower Of Hanoi - Non-recursive Approach

Implement non-recursive Towers of Hanoi. Given the number n of disks as input, maintain appropriate pegs/rods to simulate the movement of the disks among the three pegs: Source, Auxilary & Destination.
Output the sequence of moves of the disks. Following is an example of the output expected by your program.

Read full article from Just Programming...: Tower Of Hanoi - Non-recursive Approach