I am creating a system that will create a tournament based on a list of opponents.
Applicants have properties that can make them unable to fit in brackets with each other, such as gender, weight, skill level, etc.
In some cases, this becomes quite complicated:
- the applicant can rise to one weight class, but never will
- Genders can be mixed at a certain age.
What would be a good way to get these people to find the optimal braces (e.g. sizes 4, 8, 16)? Is there a known algorithm for this without trying all permutations?
source
share