We don't bite newbies here... much PerlMonks

### Re^2: Recursion: the Towers of Hanoi problem

by pg (Canon)
 on Oct 19, 2004 at 04:07 UTC ( #400403=note: print w/replies, xml ) Need Help??

in reply to Re: Recursion: the Towers of Hanoi problem
in thread Recursion: The Towers of Hanoi problem

To be fair, you didn't win today ;-)

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.

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...

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:

```sub movedisks { #to make this move
```  my( \$num, \$from, \$to, \$aux ) = @_;
if( \$num == 1 ) {
;
} else {
```    #you have to make those two moves first
movedisks( \$num-1, \$from, \$aux, \$to );
movedisks( \$num-1, \$aux, \$to, \$from );
```  }
}

Create A New User
Node Status?
node history
Node Type: note [id://400403]
help
Chatterbox?
and John Coltrane plays...

How do I use this? | Other CB clients
Other Users?
Others drinking their drinks and smoking their pipes about the Monastery: (4)
As of 2018-05-25 20:43 GMT
Sections?
Information?
Find Nodes?
Leftovers?
Voting Booth?
World peace can best be achieved by:

Results (191 votes). Check out past polls.

Notices?