Main index | All-play-all explanation | About author |
Julian D. A. Wiseman, May 2002
This 22-player all-play-all tournament design, last updated in May 2002, 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).
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:
i ii iii iv v vi vii viii ix x xi 1 M:I N:F H:R A:U B:S E:L O:K C:V T:D J:Q G:P 2 G:T S:J C:O L:K F:P Q:A H:U D:R I:V N:E B:M 3 R:F M:A I:L C:N T:E H:S D:Q U:G O:B P:K V:J 4 V:B E:P U:D Q:H J:M N:K L:C I:O R:G S:A F:T 5 P:D Q:B K:V O:E G:N J:U A:R T:H C:M L:F S:I 6 J:O T:K Q:G S:D A:V P:C I:N B:L U:F H:M E:R 7 H:N I:U M:E V:F S:L R:B J:T P:A D:K O:G Q:C 8 E:U H:V N:B P:I R:T M:D S:G F:Q J:L K:C A:O 9 Q:K D:O J:C B:T P:U G:V M:F S:E N:A I:R L:H 10 A:L R:C F:S H:G M:O I:T B:P N:J E:Q D:V U:K 11 C:S G:L T:A J:R N:Q O:F V:E K:M P:H B:U I:D 12 U:R V:M B:I N:P E:K D:H Q:S G:F L:O C:T J:A 13 T:Q J:D O:P K:B U:C A:G F:H R:S V:N E:I M:L 14 F:E A:H L:N I:C K:R S:M G:D Q:U B:J T:P O:V 15 S:P L:Q A:K E:J I:G U:O R:V M:T H:C F:B D:N 16 K:G O:S P:J T:L C:F V:Q U:M E:D A:I R:N H:B 17 I:H U:N R:M F:A L:D B:E K:J V:P S:T Q:O C:G 18 D:C B:G V:T R:O Q:I F:J E:A H:K M:P U:L N:S 19 L:V P:R S:U M:Q O:H T:N C:B J:I G:E A:D K:F 20 N:M F:I E:H U:V D:B L:R T:O A:C K:S G:J P:Q 21 B:A C:E D:F G:M H:J K:I P:L O:N Q:R V:S T:U |
Each player plays each of the others exactly once.
No player plays two consecutive games at the same venue.
Each player plays at most once on any one side of any venue.
Hence each player plays twice at ten venues and once at one venue, and each player plays eleven times on one side (left or right) and ten on the other (right or 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 160712.7738169678, which is hopefully not far from the maximum.
It has a left-right asymmetry measure of 0.50187978, which is not far from the minimum given the assignment of games to rounds and venues.
Usual disclaimer and copyright terms apply.