Task

Solve the   Towers of Hanoi   problem with recursion.




: move(n, from, to, via)
   n 0 > ifTrue: [
      move(n 1-, from, via, to)
      System.Out "Move disk from " << from << " to " << to << cr
      move(n 1-, via, to, from)
      ] ;
 
5 $left $middle $right) move 