Beefy Boxes and Bandwidth Generously Provided by pair Networks
Welcome to the Monastery
 
PerlMonks  

Re^2: Hanoi Challenge

by tilly (Archbishop)
on Oct 22, 2004 at 18:26 UTC ( #401623=note: print w/replies, xml ) Need Help??


in reply to Re: Hanoi Challenge
in thread Hanoi Challenge

Good try. It works, but gains nothing in efficiency from using all pegs. Try it with 5 pegs and 4 disks. It takes 15 moves to finish - exactly the same as the 3 peg version. Try solving it by hand. You should have no problem finishing in 7 moves.

Can you find a way to have the program to benefit more from using all pegs?

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others surveying the Monastery: (6)
As of 2022-01-26 20:44 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    In 2022, my preferred method to securely store passwords is:












    Results (70 votes). Check out past polls.

    Notices?