Beefy Boxes and Bandwidth Generously Provided by pair Networks
There's more than one way to do things
 
PerlMonks  

Re^3: Recursion: the Towers of Hanoi problem

by apotheon (Deacon)
on Oct 19, 2004 at 18:35 UTC ( #400622=note: print w/ replies, xml ) Need Help??


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

Ah! Thank you.

I'd seen this puzzle before (perhaps even in a CompSci course, and/or in a book about programming), but frankly didn't recall its conditions. I needed a memory refresher.

- apotheon
CopyWrite Chad Perrin


Comment on Re^3: 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://400622]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others scrutinizing the Monastery: (10)
As of 2015-07-07 23:27 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    The top three priorities of my open tasks are (in descending order of likelihood to be worked on) ...









    Results (93 votes), past polls