I need ideas about algorithm for distribution of plants in groups. I have, say 5, sets of plants and each set depicts a certain property e.g.,
setA= {set of all plants that are green in color}
setB = {set of all plants red in color}
setC={ all the plants that are roots also}
setD= {fruits}
setE= [flowers}
A plant can be a member of more than one set. The total no of plants is "n" and I've got "m" baskets. What is needed is to distribute all these "n" plants in "m" baskets so that for each set, all baskets have equal (or almost equal) numbers of plants from that set. And here comes the problem. If I start distribution in "m" baskets one by one for each sets, then in most of the scenarios, the last distribution will be the only valid one, i.e., the baskets will have even distribution of flowers in them but not necessarily of fruits, roots or colors etc.
How to distribute ALL of these equally? Any ideas?