Beefy Boxes and Bandwidth Generously Provided by pair Networks
Just another Perl shrine
 
PerlMonks  

Re: Recursion: the Towers of Hanoi problem

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


in reply to Recursion: The Towers of Hanoi problem

Did I miss the part where you told us what the criteria are for "finishing" the puzzle?

- apotheon
CopyWrite Chad Perrin


Comment on Re: Recursion: the Towers of Hanoi problem
Re^2: Recursion: the Towers of Hanoi problem
by Theo (Priest) on Oct 19, 2004 at 15:00 UTC
    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 ... )

      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://400388]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others exploiting the Monastery: (3)
As of 2014-07-13 03:27 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    When choosing user names for websites, I prefer to use:








    Results (245 votes), past polls