|Main index||Individual-pairs explanation||About author|
Julian D. A. Wiseman, June 2003
This 11-player individual-pairs tournament design, last updated in June 2003, is based on an original by Matt Fayers of The Department of Mathematics at Queen Mary, University of London (formerly of The Department of Pure Mathematics and Mathematical Statistics at The University of Cambridge).
|Text||Human-readable schedule, machine-readable schedule|
|Also see the individual-pairs explanation and the links to designs for other numbers of players.|
Properties of this tournament design:
i ii iii 1 C:I+K D+B:A+J G+F:E+H 2 A:G+J K+H:C+I B+E:F+D 3 F:K+D E+C:H+B J+I:A+G 4 H:J+B D+G:F+K C+A:I+E 5 I:D+E A+F:G+C B+K:H+J 6 G:B+C E+J:I+D F+H:K+A 7 K:E+A H+I:J+F C+D:G+B 8 J:C+F A+B:K+E I+G:D+H 9 D:A+H G+K:B+I F+E:J+C 10 B:F+I H+C:D+A K+J:E+G 11 E:H+G J+D:C+K I+A:B+F
This is an individual pairs for 11 players.
Each player partners each of the others exactly once, and self-partners exactly once.
Each player opposes each of the others exactly twice.
Each player plays 6 games on one side and 5 on the other.
Players play on the venues with distributions as follows: 6 players 5:3:3; 5 players 4:4:3.
No player plays at the same side of the same venue in two consecutive rounds.
Those remaining at the same venue for two consecutive rounds do so as opponents.
Staying at the same venue in consecutive rounds is done by 9 players 2 times, and 2 players 1 time.
If players are ranked, from A the best to K the worst, this tournament has an unfairness measure of 2605347.6429.
Usual disclaimer and copyright terms apply.