i can understand the basic steps. i need the bottom disc of stack 1 to be moved to the destination peg. So i need to move every disc but the last one to the temporary peg. Once i move the bottom disk to the destination peg, i have to move the other discs(currently on the temp peg) to the destination peg.

Solve(N, Src, Aux, Dst) if N is 0 exit else Solve(N-1, Src, Dst, Aux) Move from Src to Dst Solve(N-1, Aux, Src, Dst)

i just dont understand how this code follows the steps i wrote above, im trying to do a test run in my head and i get confused, any tips to grapple with this problem?