Hello,(adsbygoogle = window.adsbygoogle || []).push({});

I am having a competition with up to 60 teams. My idea was to break the 60 teams into 10 groups of 6 teams each and run a Round Robin tournament for each individual group. Simple.

Here is my problem:

What if less than 60 teams show up to the competition (i.e. 58 teams)?

An idea I am exploring for fairness is to pair up X opponents to each team from the entire pool of N teams, without pairing the same teams twice.

Is this possible and if so, is there an algorithm that can do this?

Thanks,

**Physics Forums - The Fusion of Science and Community**

# Round Robin Algorithm Help

Have something to add?

- Similar discussions for: Round Robin Algorithm Help

Loading...

**Physics Forums - The Fusion of Science and Community**