- #1
Oljeg
- 1
- 0
Hi, I am trying to find the solution (formula) for doing the following:
For any number of players (divisible by three), I need to calculate a number of rounds (in my case 8) for three players to play each other without any repetition.
So the first round of etc. 21 players would be:
1,2,3 4,5,6, 7,8,9 10,11,12 13,14,15 16,17,18 19,20, 21 and I am looking for the combinations for the next 7 rounds so that no one plays the same player again. Eventually, I would like to design a program with number of players and rounds as an input variable.
Regards,
Oljeg
For any number of players (divisible by three), I need to calculate a number of rounds (in my case 8) for three players to play each other without any repetition.
So the first round of etc. 21 players would be:
1,2,3 4,5,6, 7,8,9 10,11,12 13,14,15 16,17,18 19,20, 21 and I am looking for the combinations for the next 7 rounds so that no one plays the same player again. Eventually, I would like to design a program with number of players and rounds as an input variable.
Regards,
Oljeg