note pg <p>To be fair, you didn't win today ;-)</p> <p>Yesterday, you gave a non-recursive version of the number guessing game. You won, as in that case, there was absolutely no need for recursion, other than for fun.</p> <p>But in the case of Towers of Hanoi, the recursive version is way more beautiful than the non-recursive version. I am not talking about the fact that your code is longer than the recursive version, although that is one of those little things...</p> <p>Th real winning point is that: in the recursive version, you don't think or coding, but simply tell the computer that: to make this move, you have to make those two moves first. That's it, that's all what you need to tell the computer. The rest is not your business any more:</p> <font color="#ff0000"><code> sub movedisks { #to make this move </code></font> <font><code> my( $num, $from, $to, $aux ) = @_; if( $num == 1 ) { ; } else { </code></font> <font color="#ff0000"><code> #you have to make those two moves first movedisks( $num-1, $from, $aux, $to ); movedisks( $num-1, $aux, $to, $from ); </code></font> <font><code> } } </code></font> 400359 400400