|Main index||All-play-all explanation||About author|
Julian D. A. Wiseman, December 2004
This is a 6-player 6-venue all-play-all tournament design, and 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; 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 iv v vi 1 C:F E:A B:D 2 F:B D:A C:E 3 E:D B:C A:F 4 C:A E:B D:F 5 A:B F:E D:C
Each player plays each of the others exactly once.
Those playing twice at the same venue (D and E) do so in the first and last rounds.
Players D and E play once at three venues, and once on each side of one venue. The others play once at five venues.
No venue is idle in two consecutive rounds.
No venue is used in two consecutive rounds.
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.35233332, which is maximal.
It has a left-right asymmetry measure of 1421/3600, which is minimal given the assignment of games to rounds and venues.
Usual disclaimer and copyright terms apply.