|Main index||All-play-all explanation||About author|
Julian D. A. Wiseman, April 2004
This 4-player all-play-all tournament design was last updated in April 2004.
|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 1 A:D B:C 2 C:A D:B 3 A:B C:D
Each player plays each of the others exactly once.
All except A play once at venue i and twice at venue ii. A plays thrice at i, and never at ii.
A and C play twice on the left and once on the right; B and D twice on the right and once on the left.
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 16.00456645447463444, which is maximal.
It has a left-right asymmetry measure of 112/9 = 12.4444, which is minimal given the assignment of games to rounds and venues.
Usual disclaimer and copyright terms apply.