|Main index||Carry-over explanation||About author|
Julian D. A. Wiseman, March 2002
This is a carry-over tournament design for 10+10=20 players. It therefore assumes that two qualifying leagues (called ‘Roman’ and ‘Italic’) have played an all-play-all, and that the top 10 players from each are through to the final. In the final these 20 players are then to play each other, except that games already played between them are ‘carried over’. The players in the Roman league are called A, B, C, etc, and those in the Italic league a, b, c, etc.
It was last updated in March 2002, 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 carry-over explanation and the links to similar designs for other numbers of players.|
Properties of this tournament design:
Each player plays exactly once each of the players in the other league.
Each player plays exactly once at each venue.
Each player plays five times on each side (left and right).
It is seeded, so that important games come late in the tournament. It is assumed that player A is better than B, etc, and that a is better than b, etc. (Usually rankings are determined by the players’ scores in the qualifying rounds.)
It has a permutation score of 7164.6949407478632565471, which is either maximal or near-maximal.
It has a left-right asymmetry measure of 3524497/6350400 = 0.55500394, which is minimal.
Usual disclaimer and copyright terms apply.