comment on

So you are looking for a solution of bins where all bins are full (i.e. no available items will fit) and then the solution with the most bins.

BTW There are many solutions to even just your example:

6, 2
7, 3
5, 2
4

7, 2
6, 2
4, 5
3

7, 2
6, 2
4, 3
5

etc....
[download]

I think that is where some of the confusion is, we are used to shuffling the items to make them fit best, but in this case we don't want a best fit we want most bins. Do you have a meteric in mind for which of the solutions I just provided is best?

___________
Eric Hodges

In reply to Re: Challenge: Twist On Bin Packing by eric256
in thread Challenge: Twist On Bin Packing by Limbic~Region

Are you posting in the right place? Check out Where do I post X? to know for sure.
Posts may use any of the Perl Monks Approved HTML tags. Currently these include the following:
<code> <a> <b> <big> <blockquote> <br /> <dd> <dl> <dt> <em> <font> <h1> <h2> <h3> <h4> <h5> <h6> <hr /> <i> <li> <nbsp> <ol> <p> <small> <strike> <strong> <sub> <sup> <table> <td> <th> <tr> <tt> <u> <ul>
Snippets of code should be wrapped in <code> tags not <pre> tags. In fact, <pre> tags should generally be avoided. If they must be used, extreme care should be taken to ensure that their contents do not have long lines (<70 chars), in order to prevent horizontal scrolling (and possible janitor intervention).
Want more info? How to link or How to display code and escape characters are good places to start.


Clear questions and runnable code get the best and fastest answer
	PerlMonks