Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl Monk, Perl Meditation
 
PerlMonks  

Re^2: Recursion: the Towers of Hanoi problem

by Theo (Priest)
on Oct 19, 2004 at 15:00 UTC ( #400553=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

When all of the disks are on a different peg than they started on, size ordered smallest to largest, top to bottom. An extra "twist" is to require them to end up on a specific peg.

-Theo-
(so many nodes and so little time ... )


Comment on Re^2: Recursion: the Towers of Hanoi problem
Re^3: Recursion: the Towers of Hanoi problem
by apotheon (Deacon) on Oct 19, 2004 at 18:35 UTC
    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

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others meditating upon the Monastery: (3)
As of 2014-10-25 05:54 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    For retirement, I am banking on:










    Results (142 votes), past polls