|Main index||Individual-pairs explanation||About author|
Julian D. A. Wiseman, June 2003
This 8-player individual-pairs tournament design, last updated in June 2003, is based on an original by Dr Nicholas F. J. Inglis 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:
i ii 1 H+G:F+C B+A:D+E 2 G+D:H+E C+B:F+A 3 H+C:E+B D+A:G+F 4 E+G:B+F A+C:D+H 5 A+E:C+G F+H:B+D 6 C+D:G+B E+F:H+A 7 D+F:E+C B+H:A+G
This is an individual pairs for 8 players.
Each player partners each of the others exactly once.
Each player opposes each of the others exactly twice.
Every set of three players meet together exactly once.
Players play on the venues with distributions as follows: 4 players 4:3; 3 players 5:2; 1 player 6:1. This is as near to even as can be achieved.
Those who stay at the same venue for two consecutive rounds are partners who become opponents.
Staying at the same venue in consecutive rounds is done by 3 players 2 times, 3 players 3 times, 1 player 4 times, and 1 player 5 times. Again, this is as near to even as possible.
If players are ranked, from A the best to H the worst, this tournament has an unfairness measure of 249258.06.
This design is unique, and based on the group of order 7.
Usual disclaimer and copyright terms apply.