|Main index||All-play-all explanation||About author|
Julian D. A. Wiseman, February 2002
This 6-player all-play-all tournament design, last updated in February 2002, 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:
i ii iii 1 A:E F:B D:C 2 C:B D:E A:F 3 A:D C:F E:B 4 E:F B:D C:A 5 B:A E:C F:D
Each player plays each of the others exactly once.
No player plays two consecutive games at the same venue.
All play three times on one side (left or right) and twice on the other (right or left).
All except A play twice at two venues and once at one venue; A plays three times at i and never at ii.
It is seeded, so that important games come late in the tournament if player A is the best, B the second best, etc.
It has a permutation score of 256.3305844465074869731, which is maximal given that only A plays three times at a venue.
It has a left-right asymmetry measure of 1.0613888888, which is minimal given the assignment of games to rounds and venues.
Usual disclaimer and copyright terms apply.