|Main index||All-play-all explanation||About author|
Julian D. A. Wiseman, April 2004
This 1-player all-play-all tournament design, last updated in April 2004, is based on originals 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; Blank score sheet, with running totals|
|PDF (A3)||Schedule, in score-sheet, with running totals; Blank score sheet, with running totals|
|PDF (USL)||Schedule, in score-sheet, with running totals; Blank score sheet, with running totals|
|Text||Human-readable schedule, machine-readable schedule|
|Also see the all-play-all explanation and the links to designs for other numbers of players.|
Properties of this tournament design:
Bye 1 A
Each player plays each of the others exactly once, and each player has one bye.
At each venue each player plays exactly once on the left and exactly once on the right.
No player plays twice in succession at the same venue.
It is seeded, so that important games do not come early in the tournament.
It has a permutation score of 0, which is maximal.
It has a left-right asymmetry measure of 0, which is minimal given the assignment of games to rounds and venues.
Usual disclaimer and copyright terms apply.