title: Find N symbols as unlike to each other as possible, when given matrix of "likeness" of all existing symbols?
body: <p>I am trying to generate a set of symbols (currently bezier curves), and I need them to be as unlike to each other as possible. I have a function that compares two symbols with each other, and therefore I have a big matrix of values of how alike any two given symbols are.</p>
  
  <p>I'm sure that there are better ways than to bruteforce this? I have been looking at various solutions of vaguely related geometric problems ("Find max area polygon given set of points"), but they all seem to be solved geometrically using the pairs of coordinates, which I don't have. Same goes for "Find numbers which sum up to a certain number"; I can't generalize the solutions given there.</p>
  
  <p>I am absolutely at a loss on how to proceed now. It might be possible to somehow position the N symbols in an N-dimensional cube and play with the distances between the points as a n-dimensional polygon, but that's over my head both to formalize and to actually write. </p>
  
  <p>Currently the most I have is finding the N most-alike and least-alike symbols, as long as N is something bruteforceable.</p>
  
  <p>I'd be grateful for any pointers on how to proceed.</p>