



 
Leon, It is difficult to compute the best schedule as the number of possibilities to consider is about 10 to the power 30. I have a program that will give pretty good solutions (close to best) in cases like this. Here is what it found:
The 11 positions in each sequence represent the players, 1 through 11. The numbers represent the group that player is in. For example, on Day 1, the groups are 1, 2, 5, 9; 3, 6, 7, 10; 4, 8, 11. Because of the way the possibilities are generates, a flaw arises when there are groups of unequal size. In the schedule above, players 1 and 2 are never in the threesome. Hope this works for you.  


Math Central is supported by the University of Regina and The Pacific Institute for the Mathematical Sciences. 