Task

Solve the   Towers of Hanoi   problem with recursion.




get "libhdr"
 
let start() be move(4, 1, 2, 3)
and move(n, src, via, dest) be if n > 0 do 
$(  move(n-1, src, dest, via)
    writef("Move disk from pole %N to pole %N*N", src, dest);
    move(n-1, via, src, dest)
$)