Beefy Boxes and Bandwidth Generously Provided by pair Networks
good chemistry is complicated,
and a little bit messy -LW
 
PerlMonks  

Re^3: Best possible counts for a few test cases (in readmore) (Hanoi Challenge)

by blokhead (Monsignor)
on Oct 22, 2004 at 20:30 UTC ( #401677=note: print w/replies, xml ) Need Help??


in reply to Re^2: Best possible counts for a few test cases (in readmore) (Hanoi Challenge)
in thread Hanoi Challenge

I was just realizing something along these lines. It would be better to give a larger proportion of disks to the subpiles which will have more scratch space. How much more, I don't exactly know (yet). I've been trying to come up with a simple way to minimize the recurrence for the general case, but no luck.

If all else fails, you could search through all partitions of N-1 to find the best subproblem split, but that's no fun ;)

blokhead

  • Comment on Re^3: Best possible counts for a few test cases (in readmore) (Hanoi Challenge)

Log In?
Username:
Password:

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

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












    Results (69 votes). Check out past polls.

    Notices?