Matchmaking

[racz16]

Is there an efficient way in the library to split a pool of players into 2 teams in the most balanced way? Like splitting the players in all possible ways, calling predict_win for each split, and choosing the one where the difference is the smallest in the result of predict_win. However, obviously, for a larger number of players, it'd be slow, so is there a built-in way to split the players, or is there an algorithm that I could use, based on either the ordinal or mu?