Beefy Boxes and Bandwidth Generously Provided by pair Networks
Clear questions and runnable code
get the best and fastest answer
 
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 drinking their drinks and smoking their pipes about the Monastery: (6)
As of 2016-06-30 17:44 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    My preferred method of making French fries (chips) is in a ...











    Results (400 votes). Check out past polls.