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

Re^2: Recursion: the Towers of Hanoi problem

by Theo (Priest)
on Oct 19, 2004 at 11:00 UTC ( [id://400553]=note: print w/replies, xml ) Need Help??

This is an archived low-energy page for bots and other anonmyous visitors. Please sign up if you are a human and want to interact.


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

Replies are listed 'Best First'.
Re^3: Recursion: the Towers of Hanoi problem
by apotheon (Deacon) on Oct 19, 2004 at 14: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
[reply]

In Section Tutorials

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?

www.com | www.net | www.org
Node Status?
node history
Node Type: note [id://400553]
help
Sections?
Information?
Find Nodes?
Leftovers?
    Notices?
    • hippo‥ epoptai's answer Re: how do I set a cookie and redirect was blessed by hippo!
    • erzuuli‥ Anonymous Monks are no longer allowed to use Super Search, due to an excessive use of this resource by robots.