|
||||||||||||
|
||||||||||||
| ||||||||||||
Claude, I have a program that will check all possible schedules and choose one that is "most balanced" (has smallest variance in the number of times each pair or players is in the same group). The output is below. The positions are the players, and the numbers are the groups (0 and 1). A flaw is that player 1 is always in the threesome. The software does not handle different group sizes well. Day 1 : (0, 1, 1, 0, 0, 1, 1) In the output, the groups for day 1 are 1, 4, 5; 2, 3, 6, 7. Hope this is useful. | ||||||||||||
|
||||||||||||
Math Central is supported by the University of Regina and The Pacific Institute for the Mathematical Sciences. |