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 20:21 UTC ( #401671=note: print w/replies, xml ) Need Help??


in reply to Re: Hanoi Challenge
in thread Hanoi Challenge

I'd suggest revisiting your analysis of how good 4 pegs are. With your program I see:
10 disks with 4 pegs: Solved in 57 moves 20 disks with 4 pegs: Solved in 1137 moves 30 disks with 4 pegs: Solved in 33377 moves 40 disks with 4 pegs: Solved in 1050849 moves
That doesn't look like O(n*log(n)) to me!

Does anyone else think that they can do better?

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others chanting in the Monastery: (4)
As of 2022-01-25 12:31 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    In 2022, my preferred method to securely store passwords is:












    Results (66 votes). Check out past polls.

    Notices?