recursion - Tower of Hanoi: Recursive Algorithm - Stack Overflow

procedure Hanoi(n: integer; source, dest, by: char); Begin if (n=1) then ... Actually, the section from where you took that code offers an explanation as well: To move  ...

stackoverflow.com