title: Suggestion on algorithm to distribute objects of different value
body: <p>I have the following problem: </p>
  
  <p>Given N objects (N &lt; 30) of different values multiple of a "k" constant i.e. k, 2k, 3k, 4k, 6k, 8k, 12k, 16k, 24k and 32k, I need an algorithm that will distribute all items to M players (M &lt;= 6) in such a way that the total value of the objects each player gets is as even as possible (in other words, I want to distribute all objects to all players in the fairest way possible).</p>
  
  <p>EDIT: By fairest distribution I mean that the difference between the value of the objects any two players get is minimal. 
  Another similar case would be: I have N coins of different values and I need to divide them equally among M players; sometimes they don't divide exactly and I need to find the next best case of distribution (where no player is angry because another one got too much money).</p>
  
  <p>I don't need (pseudo)code to solve this (also, this is not a homework :) ), but I'll appreciate any ideas or links to algorithms that could solve this. </p>
  
  <p>Thanks!</p>