|Main index||Individual-pairs explanation||About author|
Julian D. A. Wiseman, June 2003
This 17-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).
|PDF (A4)||Schedule, in score-sheet, with running totals; Schedule by player; Blank score sheet, with running totals|
|PDF (A3)||Schedule, in score-sheet, with running totals; Schedule by player; Blank score sheet, with running totals|
|PDF (USL)||Schedule, in score-sheet, with running totals; Schedule by player; Blank score sheet, with running totals|
|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:
Bye i ii iii iv 1 A C+D:K+I H+M:O+Q L+B:F+P G+E:N+J 2 B M+I:C+N D+P:F+G A+E:H+Q L+O:J+K 3 C H+A:F+B L+D:Q+N K+M:G+I J+P:E+O 4 D A+M:L+P C+B:J+O H+I:K+E F+N:Q+G 5 E P+N:M+J I+Q:H+L B+O:D+G A+F:K+C 6 F G+K:Q+C J+L:I+B O+H:N+A E+D:M+P 7 G J+F:N+H O+K:B+M Q+L:E+C P+A:D+I 8 H L+C:G+M K+A:N+E F+D:J+B O+I:P+Q 9 I B+P:A+Q M+E:K+F D+N:C+O H+J:G+L 10 J O+G:E+L Q+F:M+D N+K:P+H I+C:A+B 11 K F+L:O+A G+H:P+I J+C:Q+D N+M:B+E 12 L K+H:J+D F+C:E+P G+A:O+M Q+B:I+N 13 M D+B:H+E A+I:G+J C+P:L+N K+Q:O+F 14 N E+Q:B+G P+O:C+H I+J:M+F D+K:L+A 15 O Q+J:P+K N+G:D+A E+F:I+L B+H:C+M 16 P I+E:D+O B+N:L+K M+Q:A+J C+G:F+H 17 Q N+O:I+F E+J:A+C P+G:B+K M+L:H+D
This is an individual pairs for 17 players.
Each player partners each of the others exactly once.
Each player opposes each of the others exactly twice.
No set of three players meet together more than once.
Each player opposes each of the others exactly once from the left and exactly once from the right.
Each player plays immediately before each of the others exactly once, and immediately after exactly once.
Each player plays four times on each venue.
Staying at the same venue in consecutive rounds is done by 6 players 2 times, 5 players 4 times, 3 players 3 times, 1 player 0 times, 1 player 1 time, and 1 player 6 times.
If players are ranked, from A the best to Q the worst, this tournament has an unfairness measure of 25133493.889, which is believed to be minimal.
This design is based on the group of order 17.
Usual disclaimer and copyright terms apply.