I have the following situation this year in the Volleyball league: 3 divisions consisting of 12, 16, 16 teams respectively.
We run the league with 4 30 minute slots and I was planning on taking half of the teams from each division so that would be 6, 8, 8 and having them play in slot A and the other half playing in slot B. The problem is that the same teams that played in slot A will have to play in slot C and those from slot B will have to play in slot D. Each team must play each other once. So for example using the 12 team division: A: 12 v 1, 11 v 2, 3 v 10 B: 9 v 4, 5 v 8, 7 v 6 C: 2 v 12, 1 v 3, 10 v 11 D: 6 v 9, 8 v 7, 4 v 5 and so on until everyone has played everyone once. This used to work when I had only two divisions but thus far I have failed to come up with a schedule that does not fail as I get near the end. Is there some type of algorithm out there to generate this type of schedule with a given number of teams either 12 or 16 in my case. Thanks much -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
