Task

Solve the   Towers of Hanoi   problem with recursion.




DEFINE hanoi == [[rolldown] infra] dip 
                [ [ [null] [pop pop] ] 
                  [ [dup2 [[rotate] infra] dip pred] 
                    [ [dup rest put] dip 
                      [[swap] infra] dip pred ] 
                    [] ] ] 
                condnestrec.