Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl-Sensitive Sunglasses
 
PerlMonks  

Re: Recursion: the Towers of Hanoi problem

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


in reply to Recursion: The Towers of Hanoi problem

This is a real beauty. In this case, without recursion, you have to use something like stack to rememeber all the steps you went through, and for an average person, it wold take you quite some time to make the stack right, when to push, when to pop...

With recursion, the REAL code is only about 4 or 5 lines long.

This could even be viewed as sort of AI program, but the solution is definite.


Comment on Re: Recursion: the Towers of Hanoi problem

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://400378]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others imbibing at the Monastery: (4)
As of 2014-09-20 04:16 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    How do you remember the number of days in each month?











    Results (152 votes), past polls