title: Algo. to pick best combination out of possibilities
body: <p>I have to solve following problem, basically it is to pick a best combination out of possible ones (huge) - I have to pick a best soccer team out of possible players, each player is given a score, I have to pick a team which has highest total score out of selected players. </p>
  
  <p>There is a restriction on the players that I can select: at maximum I can only pick N (=2 for instance) players from a club. E.g if I have picked G1 (from Chelsea) as goalkeeper, then only 1 slot left for Chelsea.</p>
  
  <p>Say I have to pick a best formation of 1-4-4-2</p>
  
  <p>Goalkeeper (1): g1, g2, g3, g4 ... (name of players in this position, and their scores are correspondingly gc1, gc2, gc3, gc4 ...)</p>
  
  <p>Defenders (4): d1, d2, d3, ...</p>
  
  <p>Midfielders (4): m1, m2, m3, ...</p>
  
  <p>Strikers (2): s1, s2, s3, s4, ...</p>
  
  <p>What algorithm can I use here? I am looking at the so-called Hungarian algo:
  <a href="http://en.wikipedia.org/wiki/Hungarian_algorithm" rel="nofollow">http://en.wikipedia.org/wiki/Hungarian_algorithm</a></p>
  
  <p>But it looks complicated and not sure if good for this case.</p>
  
  <p>Any help would be much appreciated.</p>
  
  <p>Best,</p>