Beefy Boxes and Bandwidth Generously Provided by pair Networks
Just another Perl shrine
 
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?
[Corion]: Actually bsd_glob '{www.,}perlmonks .{com,net,org}', plus css.perlmonks.org I think
[Corion]: Sad that Let's Encrypt does not allow wildcard certificates, but they could be somewhat of a hassle to verify
[Discipulus]: since 2002 I just usewd www.perlmonks.org and good morning
Discipulus .oO(maybe a PM discussion?)

How do I use this? | Other CB clients
Other Users?
Others meditating upon the Monastery: (8)
As of 2017-09-26 07:52 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    During the recent solar eclipse, I:









    Results (292 votes). Check out past polls.

    Notices?