Round Robin TournamentsProblemThe problem is to schedule a tournament of n teams over n-1 weeks, with each week divided into n/2 periods, and each period divided into two slots. The first team in each slot plays at home, whilst the second plays the first team away. A tournament must satisfy the following three constraints: every team plays once a week; every team plays at most twice in the same period over the tournament; every team plays every other team. InputThe number of teams in the tournament OutputLinear program
SAT
Assignment for boolean variables tiwjpk, i=1..n, j=1..n-1, k=1..n/2 (eg. t1w3p2) [TCS main] [Contact Info] [Personnel] [Research] [Publications] [Software] [Studies] [News Archive] [Links] Latest update: 23 February 2006. |