Main index | Individual-pairs explanation | About author |
Julian D. A. Wiseman, June 2003
This 15-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).
Available formats: | |
---|---|
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:
i ii iii iv 1 A:G+N B+H:C+D E+O:L+I F+J:K+M 2 C+I:D+E G+K:L+N F+A:M+J B:H+O 3 H+L:M+O C:I+A G+B:N+K D+J:E+F 4 D:J+B E+K:F+G H+C:O+L I+M:N+A 5 F+L:G+H J+N:O+B I+D:A+M E:K+C 6 K+O:A+C F:L+D J+E:B+N G+M:H+I 7 G:M+E H+N:I+J K+F:C+O L+A:B+D 8 I+O:J+K M+B:C+E L+G:D+A H:N+F 9 N+C:D+F I:O+G M+H:E+B J+A:K+L 10 J:A+H K+B:L+M N+I:F+C O+D:E+G 11 L+C:M+N A+E:F+H O+J:G+D K:B+I 12 B+F:G+I L:C+J A+K:H+E M+D:N+O 13 M:D+K N+E:O+A B+L:I+F C+G:H+J 14 O+F:A+B D+H:I+K C+M:J+G N:E+L 15 E+I:J+L O:F+M D+N:K+H A+G:B+C |
This is an individual pairs for 15 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 8 games on one side and 7 on the other.
All players play on the venues with distribution 4:4:4:3.
No player plays at the same venue in two consecutive rounds.
If players are ranked, from A the best to O the worst, this tournament has an unfairness measure of 1192793565.35.
Usual disclaimer and copyright terms apply.