Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl: the Markov chain saw
 
PerlMonks  

Re^4: Challenge: Twist On Bin Packing

by moklevat (Priest)
on Apr 07, 2006 at 21:31 UTC ( [id://541981]=note: print w/replies, xml ) Need Help??


in reply to Re^3: Challenge: Twist On Bin Packing
in thread Challenge: Twist On Bin Packing

Ack! Neat! Can you describe the algorithm?

Replies are listed 'Best First'.
Re^5: Challenge: Twist On Bin Packing
by Anonymous Monk on Apr 08, 2006 at 20:34 UTC
    No, I'm still trying to work one out :)

    I figured if the smallest to largest wasn't going to work, it would likely be due to combinations of numbers where the smaller numbers add up to 10, but using larger numbers add up to 9.

    A little trial and error found it.


    I'm kinda thinking about something along the lines of "Use all the 1s to add up to 10, use all the 2s to add up 9, use all the 3s to add up 8, etc.", but I haven't been able to determine whether that is always going to work or not.
[reply]

In Section Seekers of Perl Wisdom

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

How do I use this? • Last hour • Other CB clients
Other Users?
Others studying the Monastery: (1)
As of 2024-04-24 16:55 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found