I'm trying to work out the maximum number of unique combinations for the following rules. This is part of me learning python.
There are $16$ teams $[1,2,3....16]$, the teams only play each other once, $\dfrac{n(n-1)}{2}$ is the maximum number of possible unique games $(120)$, this is a common round robin format.
There are only $8$ courts with $8$ concurrent games played each round, over $15$ rounds.
A team may only play on each court once.
How many rounds does it take before I run out of unique combinations.
The code gives me almost $4$ rounds or $31$ games out of a possible $64$ games for $8$ courts and $8$ rounds.
I want to be able to maximise number of unique combinations given the limitations on the number of grounds to test how efficient the code is working.
This is a bit of an edit on the original question as a few things became clearer after I mapped out the problem, see attached image.
map of court and team allocations by round just using best fit by round
