|
|
|
| Keep It Simple, Stupid | |
| PerlMonks |
Re: Re: Puzzle: need a more general algorithmby dws (Chancellor) |
| on Jul 08, 2002 at 23:49 UTC ( [id://180353]=note: print w/replies, xml ) | Need Help?? |
|
Here's an observation that might lead to a quick way to determine unique bucket combinations.
The set of bucket sizes above is the union of two sets: the set of all unique arrangements of (1 1 1 3), and the set of all unique arrangements of (1 1 2 2). The sum of the numbers is equal to the number of catagories. This can be generalized to cover different numbers of buckets and different numbers of categories.
In Section
Seekers of Perl Wisdom
|
|
||||||||||||||||||||||