Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Matchmaking #171

Unanswered
racz16 asked this question in Q&A
Sep 6, 2025 · 0 comments
Discussion options

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?

You must be logged in to vote

Replies: 0 comments

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Category
Q&A
Labels
None yet
1 participant

AltStyle によって変換されたページ (->オリジナル) /