sunny

• Mar 13th, 2007

 

Let call the three pegs Src (Source), Aux (Auxiliary) and Dst (Destination).For a given number N of disks, the problem appears to be solved if we know how to accomplish the following tasks:1.Move the top N-1 disks from Src to Aux (using Dst as an intermediary peg) 2.Move the bottom disk from Src to Dst 3.Move N-1 disks from Aux to Dst (using Src as an intermediary peg)