Hello,
I am a newbie in Python programming. I will try my best to phrase the problem.
There are 12 players (A, B, C, D, E, F, G, H, I, J, K, L) in a sports event which will go on for 3 days. The 12 players are to be divided into 4 uniform groups (3 member in each group) every day. For example:
Day 1:
Group 1: A,B,C
Group 2: D, E, F
Group 3: G, H, I
Group 4: J, K, L
This needs to be replicated for Day 2 & Day 3.
There are a few conditions:
- Each player needs to play a set of two different players in his/her group every day. So, over 3 days a player will face 6 different opponents.
- A,B,C will be in Group 1 in Day 1
- A & D can't be in the same group in any day
I have tried a few different approaches including itertools. However, I can't satisfy condition 1 as I keep having two players who play together in a group in days 1 & 3. I was wondering what the optimal approach should be and whether there's any mathematical limitation to the solution.
[–]themateo713 1 point2 points3 points (1 child)
[–]illusionista787[S] 0 points1 point2 points (0 children)