Not sure if this has already been discussed in which case apologies & please point me to the thread.
We need to schedule matches between 2 teams of 8 with everyone playing all rounds. The play is in pairs across 5 possible courts. Each member of a team plays once with a colleague and twice against (almost all) members of opposing teams but never in the same combination. Equal use of each court would be good.
How good a solution is possible?
Are there standard algorithms for sorting this sort of stuff out? Or even standard approaches? My maths is rusty!
Any ideas on a solution for 2 teams of 10 players?
Thank you in advance.