Main index | All-play-all explanation | About author |
Julian D. A. Wiseman, April 2004
This 3-player all-play-all tournament design was last updated in April 2004.
Available formats: | |
---|---|
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 i 1 A B:C 2 B C:A 3 C A:B |
Each player plays each of the others exactly once, and each has one bye.
Each player plays once on the left and once on the right.
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.00390625, which is maximal.
It has a left-right asymmetry measure of 31/9 = 3.444444, which is minimal given the assignment of games to rounds and venues.
Usual disclaimer and copyright terms apply.