Main index | Carry-over explanation | About author |

*Julian D. A. Wiseman, April 2004*

This is a carry-over tournament design for 1+1=2 players.
It therefore assumes that two qualifying leagues (called ‘Roman’ and ‘Italic’) have played an all-play-all, and that the top player from each are through to the final.
In the final these two are then to play each other.
The player in the Roman league is called A, and the player in the Italic league *a*.

It 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 carry-over explanation and the links to similar designs for other numbers of players. |

Properties of this tournament design:

i | |
---|---|

1 | A:a |

Each player plays exactly once each of the players in the other league.

Each player plays exactly once at each venue.

It is seeded, trivially.

It has a permutation score of 0, which is maximal.

It has a left-right asymmetry measure of 1, which is minimal.

Usual disclaimer and copyright terms apply.