Task

Solve the   Towers of Hanoi   problem with recursion.




Func Hanoi( n, f, t, v ) = 
if n = 0 then 
    !'';
else 
    Hanoi(n - 1, f, v, t); 
    !f;!' -> ';!t;!',   ';
    Hanoi(n - 1, v, t, f)  
fi.