I have spent too long trying to figure this out and cannot seem to get it just right, so here I am asking the Math gods. This weekend I played in a volleyball tournament called "King of the Beach", where the tournament was structured with two pools of individual players. The format was in such a way that each player would play every other player in their own pool, with a player from the second pool as their teammate (ie pool A-F and pool 1-6). An example match would be the teams of A1 vs B2 or A1 vs C5.
Under this format, all letters (A-F) would play all other letters with a number (1-6) partner, and all numbers would player all other numbers with a letter partner.
I am trying to set up something similar for a team building exercise at work with 12 different people (needing two pools of 6). My issue is that I end up with all letters playing all other letters and all numbers playing all other numbers, yet player A may end up playing against number 4 three different times.
Maybe what I am trying to do is not even possible, but ideally I would take these two pools and make every letter play every other letter, while also only playing each number once. I have looked this up online and fail to find anything that is much help, so any help someone may have would be greatly appreciated. Thanks.
Pool 1
A
B
C
D
E
F
Pool 2
1
2
3
4
5
6
Try this: Let's pair each letter to each number for the first 5 games. i.e. $$\begin{matrix} A & 1 \\ B&2\\C&3\\D&4\\E&5\\F&6\\\end{matrix}$$ Why 5? Because there are $\frac{n!}{k!(n-k)!}$ unique combinations of $k$ letters, so if we have 2, we have 15 ways of combining them. Since 6/2 =3, we have that we can have 5 games where each pairing is unique. Now for the last "round", each letter hasn't played the number it was on the team with. So we just swap the numbers for each pair like this: $$\begin{matrix}A&2\\B&1\\C&4\\D&3\\E&6\\F&5\\\end{matrix}$$ with the game pairs given by the letter $(A,B), (C,D), (E,F)$.
Hope this answers this question.