Note that none of your solutions are fair because they all have some players playing on more teams than other players.
Update: Also note that a likely scenario for applying this algorithm is a gathering of 24 people where they break up into teams. This requires that the list of possible teams can be divided into "rounds" where each round has every player on exactly one team. I'm curious what the maximal solutions are with and without the requirement of rounds (but with the requirement of being "fair", of course). Even the maximal number of teams without a requirement of fairness would be interesting.
But from a practical standpoint, it may be even more valuable to come up with solutions that are more fair but don't require the number of repeated pairings to be zero, just to be minimized.
- tye
In reply to Re^2: Unique Combos with Math::Combinatorics (fair)
by tye
in thread Unique Combos with Math::Combinatorics
by ketema
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |