# Round-robin tournament

Last updated

A round-robin tournament (or all-play-all tournament) is a competition in which each contestant meets every other participant, usually in turn. [1] [2] A round-robin contrasts with an elimination tournament, in which participants are eliminated after a certain number of losses.

## Terminology

The term round-robin is derived from the French term ruban, meaning "ribbon". Over a long period of time, the term was corrupted and idiomized to robin. [3] [4]

In a single round-robin schedule, each participant plays every other participant once. If each participant plays all others twice, this is frequently called a double round-robin. The term is rarely used when all participants play one another more than twice, [1] and is never used when one participant plays others an unequal number of times (as is the case in almost all of the major United States professional sports leagues – see AFL (1940–41) and All-America Football Conference for exceptions). In the United Kingdom, a round-robin tournament has been called an American tournament in sports such as tennis or billiards which usually have knockout tournaments, although this is now rarely, if ever, done. [5] [6] [7] In Italian it is called girone all'italiana (literally "Italian-style group"). In Serbian it is called the Berger system (Бергеров систем, Bergerov sistem), after chess player Johann Berger. In Brazil it is called (sistema de pontos corridos), referring to the accumulation of accounted points as the determinant of each participant's final performance, once all participants have played their games.

A round-robin tournament with four players is sometimes called "quad" or "foursome". [8]

## Use

In sports with a large number of competitive matches per season, double round-robins are common. Most association football leagues in the world are organized on a double round-robin basis, in which every team plays all others in its league once at home and once away. This system is also used in qualification for major tournaments such as the FIFA World Cup and the continental tournaments (e.g. UEFA European Championship, CONCACAF Gold Cup, AFC Asian Cup, CONMEBOL Copa América and CAF Cup of Nations). There are also round-robin bridge, chess, draughts, go, ice hockey, curling, and Scrabble tournaments. The World Chess Championship decided in 2005 and in 2007 on an eight-player double round-robin tournament where each player faces every other player once as white and once as black.

In a more extreme example, the KBO League of baseball plays a 16-fold round robin, with each of the 10 teams playing each other 16 times for a total of 144 games per team.

Group tournaments rankings usually go by number of matches won and drawn, with any of a variety of tiebreaker criteria.

Frequently, pool stages within a wider tournament are conducted on a round-robin basis. Examples with single round-robin scheduling include the FIFA World Cup, UEFA European Football Championship, and UEFA Cup (2004–2009) in football, Super Rugby (rugby union) in the Southern Hemisphere during its past iterations as Super 12 and Super 14 (but not in its later 15- and 18-team formats), the Cricket World Cup along with Indian Premier League, major Twenty-20 Cricket tournament, and many American Football college conferences, such as the Big 12 (which currently has 10 members). The group phases of the UEFA club competitions and Copa Libertadores are contested as a double round-robin, as are most basketball leagues outside the United States, including the regular season of the EuroLeague (as well as its former Top 16 phase); the United Football League has used a double round-robin for both its 2009 and 2010 seasons.

Season ending tennis tournaments also use a round robin format prior to the semi on stages.

## Evaluation

The champion in a round-robin tournament is the contestant that wins the most games, except when draws are possible.

In theory, a round-robin tournament is the fairest way to determine the champion from among a known and fixed number of contestants. Each contestant, whether player or team, has equal chances against all other opponents because there is no prior seeding of contestants that will preclude a match between any given pair. The element of luck is seen to be reduced as compared to a knockout system since one or two bad performances need not ruin a competitor's chance of ultimate victory. Final records of participants are more accurate, in the sense that they represent the results over a longer period against the same opposition.

The system is also better for ranking all participants, not just determining the winner. This is helpful to determine the final rank of all competitors, from strongest to weakest, for purposes of qualification for another stage or competition as well as for prize money.

In team sport the (round-robin) major league champions are generally regarded as the "best" team in the land, rather than the (elimination) cup winners.

Moreover, in tournaments such as the FIFA or ICC World Cups, a first round stage consisting of a number of mini round robins between groups of 4 teams guards against the possibility of a team travelling possibly thousands of miles only to be eliminated after just one poor performance in a straight knockout system. The top one, two, or occasionally three teams in these groups then proceed to a straight knockout stage for the remainder of the tournament.

In the circle of death (see below), it is possible that no champion emerges from a round-robin tournament, even if there is no draw. However, most sports have tie-breaker systems which resolve this.

Round-robins can suffer from being too long compared to other tournament types, and with later scheduled games potentially not having any substantial meaning. They may also require tiebreaking procedures.

Swiss system tournaments attempt to combine elements of the round-robin and elimination formats, to provide a worthy champion using fewer rounds than a round-robin, while allowing draws and losses.

#### Tournament length

The main disadvantage of a round robin tournament is the time needed to complete it. Unlike a knockout tournament where half of the participants are eliminated after each round, a round robin requires one round less than the number of participants. For instance, a tournament of 16 teams can be completed in just 4 rounds (i.e. 15 matches) in a knockout (single elimination) format; a double elimination tournament format requires 30 (or 31) matches, but a round-robin would require 15 rounds (i.e. 120 matches) to finish if each competitor faces each other once.

Other issues stem from the difference between the theoretical fairness of the round robin format and practice in a real event. Since the victor is gradually arrived at through multiple rounds of play, teams who perform poorly, who might have been quickly eliminated from title contention, are forced to play out their remaining games. Thus games are played late in the competition between competitors with no remaining chance of success. Moreover, some later matches will pair one competitor who has something left to play for against another who does not. It may also be possible for a competitor to play the strongest opponents in a round robin in quick succession while others play them intermittently with weaker opposition. This asymmetry means that playing the same opponents is not necessarily completely equitable.

There is also no scheduled showcase final match unless (by coincidence) two competitors meet in the last match of the tournament, with the result of that match determining the championship. A notable instance of such an event was the 1950 FIFA World Cup match between Uruguay and Brazil.

#### Qualified teams

Further issues arise where a round-robin is used as a qualifying round within a larger tournament. A competitor already qualified for the next stage before its last game may either not try hard (in order to conserve resources for the next phase) or even deliberately lose (if the scheduled next-phase opponent for a lower-placed qualifier is perceived to be easier than for a higher-placed one).

Four pairs in the 2012 Olympics Women's doubles badminton, having qualified for the next round, were ejected from the competition for attempting to lose in the round robin stage to avoid compatriots and better ranked opponents. [9] The round robin stage at the Olympics was a new introduction, and these potential problems were readily known prior to the tournament; changes were made prior to the next Olympics to prevent a repeat of these events.

#### Circle of death

Another disadvantage, especially in smaller round-robins, is the "circle of death", where teams cannot be separated on a head-to-head record. In a three-team round-robin, where A defeats B, B defeats C, and C defeats A, all three competitors will have a record of one win and one loss, and a tiebreaker will need to be used to separate the teams. [10] This famously happened during the 1994 FIFA World Cup Group E, where all four teams finished with a record of one win, one draw, and one loss. This phenomenon is analogous to the Condorcet paradox in voting theory.

## Scheduling algorithm

If ${\displaystyle n}$ is the number of competitors, a pure round robin tournament requires ${\displaystyle {\begin{matrix}{\frac {n}{2}}\end{matrix}}(n-1)}$ games. If ${\displaystyle n}$ is even, then in each of ${\displaystyle (n-1)}$ rounds, ${\displaystyle {\begin{matrix}{\frac {n}{2}}\end{matrix}}}$ games can be run concurrently, provided there exist sufficient resources (e.g. courts for a tennis tournament). If ${\displaystyle n}$ is odd, there will be ${\displaystyle n}$ rounds, each with ${\displaystyle {\begin{matrix}{\frac {n-1}{2}}\end{matrix}}}$ games, and one competitor having no game in that round.

### Circle method

The circle method is the standard algorithm to create a schedule for a round-robin tournament[ citation needed ]. All competitors are assigned to numbers, and then paired in the first round:

 1 2 3 4 5 6 7 14 13 12 11 10 9 8

Next, one of the competitors in the first or last column of the table is fixed (number one in this example) and the others rotated clockwise one position

 1 14 2 3 4 5 6 13 12 11 10 9 8 7
 1 13 14 2 3 4 5 12 11 10 9 8 7 6

This is repeated until you end up almost back at the initial position:

 1 3 4 5 6 7 8 2 14 13 12 11 10 9

To see that - with an even number ${\displaystyle n}$ of competitors - this algorithm realizes every possible combination of them (equivalently, that all pairs realized are pairwise different), we argue as follows.

First, the algorithm obviously realizes every pair of competitors if one of them equals ${\displaystyle 1}$ (the non-moving competitor).

Next, for pairs of non-${\displaystyle 1}$ competitors, let their distance be the number ${\displaystyle k<{\frac {n}{2}}}$ of times the rotation has to be carried out in order that one competitor arrives at the position the other had.

In the example given (${\displaystyle n=14}$), ${\displaystyle 2}$ has distance ${\displaystyle 1}$ to ${\displaystyle 3}$ and to ${\displaystyle 14}$ and it has distance ${\displaystyle 6}$ to ${\displaystyle 8}$ and to ${\displaystyle 9}$.

In a round, a non-leftmost position (not including ${\displaystyle 1}$) can only be taken by competitors of a fixed distance. In round ${\displaystyle 1}$ of the example, in the second position competitor ${\displaystyle 2}$ plays against ${\displaystyle 13}$, their distance is ${\displaystyle 2}$. In round ${\displaystyle 2}$, this position is held by competitors ${\displaystyle 14}$ and ${\displaystyle 12}$, also having distance ${\displaystyle 2}$, etc. Similarly, the next position (${\displaystyle 3}$ against ${\displaystyle 12}$ in round ${\displaystyle 1}$, ${\displaystyle 2}$ against ${\displaystyle 11}$ in round ${\displaystyle 2}$, etc.) can only hold distance-${\displaystyle 4}$ competitors.

For every ${\displaystyle k<{\frac {n}{2}}}$, there are exactly ${\displaystyle n-1}$ pairs of distance ${\displaystyle k}$. There are ${\displaystyle n-1}$ rounds and they all realize one distance-${\displaystyle k}$ pair at the same position. Clearly, these pairs are pairwise different. The conclusion is that every distance-${\displaystyle k}$ pair is realized.

This holds for every ${\displaystyle k}$, hence, every pair is realized.

If there are an odd number of competitors, a dummy competitor can be added, whose scheduled opponent in a given round does not play and has a bye. The schedule can therefore be computed as though the dummy were an ordinary player, either fixed or rotating.

Instead of rotating one position, any number relatively prime to ${\displaystyle (n-1)}$ will generate a complete schedule. The upper and lower rows can indicate home/away in sports, white/black in chess, etc.; to ensure fairness, this must alternate between rounds since competitor 1 is always on the first row. If, say, competitors 3 and 8 were unable to fulfil their fixture in the third round, it would need to be rescheduled outside the other rounds, since both competitors would already be facing other opponents in those rounds. More complex scheduling constraints may require more complex algorithms. [11] This schedule is applied in chess and draughts tournaments of rapid games, where players physically move round a table. In France this is called the Carousel-Berger system (Système Rutch-Berger). [12]

The schedule can also be used for "asynchronous" round-robin tournaments where all games take place at different times (for example, because there is only one venue). The games are played from left to right in each round, and from the first round to the last. When the number of competitors is even, this schedule performs well with respect to quality and fairness measures such as the amount of rest between games. On the other hand, when the number of competitors is odd, it does not perform so well and a different schedule is superior with respect to these measures. [13]

### Berger tables

Alternatively Berger tables, [14] named after the Austrian chess master Johann Berger, are widely used in the planning of tournaments [15] . Berger published the pairing tables in his two Schach-Jahrbücher (Chess Annals), [16] [17] with due reference to its inventor Richard Schurig. [18] [19]

 Round 1 Round 2 Round 3 ... Round 13 1 – 14 2 – 13 3 – 12 4 – 11 5 – 10 6 – 9 7 – 8 14 – 8 9 – 7 10 – 6 11 – 5 12 – 4 13 – 3 1 – 2 2 – 14 3 – 1 4 – 13 5 – 12 6 – 11 7 – 10 8 – 9 ... 7 – 14 8 – 6 9 – 5 10 – 4 11 – 3 12 – 2 13 – 1

This constitutes a schedule where player 14 has a fixed position, and all other players are rotated counterclockwise ${\displaystyle {\frac {n}{2}}}$ positions. This schedule is easily generated manually. To construct the next round, the last player, number 8 in the first round, moves to the head of the table, followed by player 9 against player 7, player 10 against 6, until player 1 against player 2. Arithmetically, this equates to adding ${\displaystyle {\frac {n}{2}}}$ to the previous row, with the exception of player ${\displaystyle n}$. When the result of the addition is greater than ${\displaystyle (n-1)}$, then subtract ${\displaystyle (n-1)}$ from the sum.

This schedule can also be represented as a (n-1, n-1) table, expressing a round in which players meets each other. For example, player 7 plays against player 11 in round 4. If a player meets itself, then this shows a bye or a game against player n. All games in a round constitutes a diagonal in the table.

Diagonal Scheme
×234567891011121312345678910111213
112345678910111213
212345678910111213
312345678910111213
412345678910111213
512345678910111213
612345678910111213
712345678910111213
812345678910111213
912345678910111213
1012345678910111213
1112345678910111213
1212345678910111213
131 2 3 4 5 6 7 8 9 10111213
Round Robin Schedule
×12345678910111213
112345678910111213
223456789101112131
334567891011121312
445678910111213123
556789101112131234
667891011121312345
778910111213123456
889101112131234567
991011121312345678
1010111213123456789
1111121312345678910
1212131234567891011
1313123456789101112

The above schedule can also be represented by a graph, as shown below:

Both the graph and the schedule were reported by Édouard Lucas in [20] as a recreational mathematics puzzle. Lucas, who describes the method as simple and ingenious, attributes the solution to Felix Walecki, a teacher at Lycée Condorcet. Lucas also included an alternative solution by means of a sliding puzzle.

### Original construction of pairing tables by Richard Schurig (1886)

For an even number ${\displaystyle n}$ or an odd number ${\displaystyle n-1}$ of competitors, Schurig [19] builds a table with ${\displaystyle n/2}$ vertical rows and ${\displaystyle n-1}$ horizontal rows. Then he populates it starting from the top left corner by repeating the sequence of numbers from 1 up to ${\displaystyle n-1}$. Here is an example table for 7 or 8 competitors:

 Round 1 Round 2 Round 3 Round 4 1 2 3 4 5 6 7 1 2 3 4 5 6 7 1 2 3 4 5 6 7 1 2 3 4 5 6 7

Then to get the opponents a second table is constructed. Every horizontal row ${\displaystyle x}$ is populated with the same numbers as row ${\displaystyle x+1}$ in the previous table (the last row is populated with numbers from the first row in the original table), but in the reverse order (from right to left).

Round 1 Round 2 Round 3 Round 4 – 1 – 7 – 6 – 5 – 5 – 4 – 3 – 2 – 2 – 1 – 7 – 6 – 6 – 5 – 4 – 3 – 3 – 2 – 1 – 7 – 7 – 6 – 5 – 4 – 4 – 3 – 2 – 1

By merging above tables we arrive at:

Round 1 Round 2 Round 3 Round 4 1 – 1 2 – 7 3 – 6 4 – 5 5 – 5 6 – 4 7 – 3 1 – 2 2 – 2 3 – 1 4 – 7 5 – 6 6 – 6 7 – 5 1 – 4 2 – 3 3 – 3 4 – 2 5 – 1 6 – 7 7 – 7 1 – 6 2 – 5 3 – 4 4 – 4 5 – 3 6 – 2 7 – 1

Then the first column is updated: if the number of competitors is even, player number ${\displaystyle n}$ is alternatingly substituted for the first and second positions, whereas if the number of competitors is odd a bye is used instead.

The pairing tables were published as an annex concerning the arrangements for the holding of master tournaments. Schurig did not provide a proof nor a motivation for his algorithm. For more historical details, see Ahrens. [21]

## Related Research Articles

The Elo rating system is a method for calculating the relative skill levels of players in zero-sum games such as chess. It is named after its creator Arpad Elo, a Hungarian-American physics professor.

A tournament is a competition involving at least three competitors, all participating in a sport or game. More specifically, the term may be used in either of two overlapping senses:

1. One or more competitions held at a single venue and concentrated into a relatively short time interval.
2. A competition involving a number of matches, each involving a subset of the competitors, with the overall tournament winner determined based on the combined results of these individual matches. These are common in those sports and games where each match must involve a small number of competitors: often precisely two, as in most team sports, racket sports and combat sports, many card games and board games, and many forms of competitive debating. Such tournaments allow large numbers to compete against each other in spite of the restriction on numbers in a single match.

A sports league is a group of sports teams or individual athletes that compete against each other and gain points in a specific sport. At its simplest, it may be a local group of amateur athletes who form teams among themselves and compete on weekends; at its most complex, it can be an international professional league making large amounts of money and involving dozens of teams and thousands of players.

A single-elimination, knockout, or sudden death tournament is a type of elimination tournament where the loser of each match-up is immediately eliminated from the tournament. Each winner will play another in the next round, until the final match-up, whose winner becomes the tournament champion. Each match-up may be a single match or several, for example two-legged ties in European sports or best-of series in American pro sports. Defeated competitors may play no further part after losing, or may participate in "consolation" or "classification" matches against other losers to determine the lower final rankings; for example, a third place playoff between losing semi-finalists. In a shootout poker tournament, there are more than two players competing at each table, and sometimes more than one progressing to the next round. Some competitions are held with a pure single-elimination tournament system. Others have many phases, with the last being a single-elimination final stage, often called playoffs.

A double-elimination tournament is a type of elimination tournament competition in which a participant ceases to be eligible to win the tournament's championship upon having lost two games or matches. It stands in contrast to a single-elimination tournament, in which only one defeat results in elimination.

Repechage is a practice in series competitions that allows participants who failed to meet qualifying standards by a small margin to continue to the next round. A well known example is the wild card system.

A Swiss-system tournament is a non-eliminating tournament format that features a fixed number of rounds of competition, but considerably fewer than for a round-robin tournament; thus each competitor does not play all the other competitors. Competitors meet one-on-one in each round and are paired using a set of rules designed to ensure that each competitor plays opponents with a similar running score, but does not play the same opponent more than once. The winner is the competitor with the highest aggregate points earned in all rounds. With an even number of participants, all competitors play in each round.

The Candidates Tournament is a chess tournament organized by FIDE, chess's international governing body, since 1950, as the final contest to determine the challenger for the World Chess Championship. The winner of the Candidates earns the right to a match for the World Championship against the incumbent World Champion.

There are a number of formats used in various levels of competition in sports and games to determine an overall champion. Some of the most common are the single elimination, the best-of- series, the total points series more commonly known as on aggregate, and the round-robin tournament.

The Page playoff system is a playoff format used primarily in softball and curling at the championship level, the Indian Premier League and Pakistan Super League cricket tournaments. Teams are seeded using a round-robin tournament and the top four play a mix of a single-elimination and double-elimination tournament to determine the winner. It is identical to a four-team McIntyre System playoff, first used by the WANFL, SANFL and VFL in Australia in 1931, originally called the Page–McIntyre system, after the VFL delegate, the Richmond Football Club's Secretary, Percy "Pip" Page, who had advocated its use.

In sport, a bye is the preferential status of a player or team that is automatically advanced to the next round of a tournament, without having to play an opponent in an early round.

In a group tournament, unlike a knockout tournament, there is no scheduled decisive final match. Instead, all the competitors are ranked by examining the results of all the matches played in the tournament. Typically, points are awarded for each match, with competitors ranked based either on total number of points or average points per match.

Swiss system tournaments, a type of group tournament common in chess and other boardgames, use various criteria to break ties between players who have the same total number of points after the last round. This is needed when prizes are indivisible, such as titles, trophies, or qualification for another tournament. Otherwise players often share the tied spots, with cash prizes being divided equally among the tied players.

A chess tournament is a series of chess games played competitively to determine a winning individual or team. Since the first international chess tournament in London, 1851, chess tournaments have become the standard form of chess competition among serious players.

A duplicate bridge movement is a scheme used in a duplicate bridge session to arrange which competitors play which opponents when, and which boards they play. The arrangement has to satisfy various constraints which often conflict to some extent, requiring compromises. The resolution of these compromises is to a considerable extent a matter of taste, so players should be consulted as to their preferences if this is practicable.

Norway Chess is an annual closed chess tournament, typically taking place in the May to June time period every year. The first edition took place in the Stavanger area, Norway, from 7 May to 18 May 2013. The 2013 tournament had ten participants, including seven of the ten highest rated players in the world per the May 2013 FIDE World Rankings. It was won by Sergey Karjakin, with Magnus Carlsen and Hikaru Nakamura tied for second place. Norway Chess 2015 took place in mid-June 2015 and was a part of the inaugural Grand Chess Tour. The tournament has since decided to withdraw from the Grand Chess Tour.

The 2020–2021 Candidates Tournament was an eight-player chess double round-robin tournament to decide the challenger for the World Chess Championship 2021, played in Yekaterinburg, Russia. Ian Nepomniachtchi won the tournament with a round to spare and earned the right to challenge the defending world champion, Magnus Carlsen.

The FIDE World Fischer Random Chess Championship 2019 was the first world championship in Fischer Random Chess officially recognized by the international chess federation FIDE. Previous unofficial championships had been held, with the most recent winner being Magnus Carlsen in 2018. The competition started on April 28, 2019, with the first qualifying tournaments, which took place online and were open to all interested participants; and continued with further rounds up to the quarter-finals, which were also online. The semi-finals and final were played over the board between October 27 to November 2, 2019, in the Henie Onstad Kunstsenter in Bærum in Norway. The winner of the final was Wesley So, defeating Magnus Carlsen 13.5–2.5, to become the first FIDE world champion in Fischer Random Chess. Over the course of the competition, various time controls were applied, with longer games being weighted more heavily.

The 2022 Candidates Tournament was an eight-player chess tournament to decide the challenger for the World Chess Championship 2023. The tournament took place at the Palacio de Santoña in Madrid, Spain, from June 16 to July 5, 2022, with the World Championship to follow in early 2023. As with every Candidates tournament since 2013, it was a double round-robin tournament.

The Champions Chess Tour 2022, known for sponsorship reasons as the Meltwater Champions Chess Tour, is a 9-month series of nine online chess tournaments featuring some of the world's top players, who play for a prize money pool of US\$1.6 million. The tour started on February 19, 2022 and will last until November 20, 2022.

## References

1. Webster's Third New International Dictionary of the English Language, Unabridged (1971, G. & C. Merriam Co), p.1980.
2. Orcutt, William Dana (1895). Official Lawn Tennis Bulletin. Vol. 2. New York: The Editors. pp. 1, 3.
3. Strehlov, Richard A; Wright, Sue Ellen, eds. (1993). Standardizing Terminology for Better Communication: Practice, Applied Theory, and Results. Vol. 1166. ASTM. pp. 336–337. ISBN   0-8031-1493-1.
4. Brewer's Dictionary of Phrase & Fable . New York: Harper & Brother Publishers. p. 786.
5. "A Glossary of Terms Used in Connection with Billiards". Billiard Monthly. English Amateur Billiards Association. February 1912. Archived from the original on March 3, 2022. American Tournament: A tournament in which each player must meet in turn every other player.
6. Allied. "American tournament". Chambers 21st Century Dictionary. Allied Publishers. p. 38. ISBN   978-0550106254 . Retrieved August 1, 2012.
7. Mead, Shepherd (1977). How to succeed in tennis without really trying: the easy tennismanship way to do all the things no tennis pro can teach you. McKay. p. 130. ISBN   9780679507499 . Retrieved August 1, 2012.
8. "An Introduction to USCF-Rated Tournaments" (PDF). The United States Chess Federation. February 23, 2006.
9. "Eight Olympic badminton players disqualified for 'throwing games'". The Guardian . August 1, 2012. Retrieved August 1, 2012.
10. "UC Berkeley Quiz Bowl: How To Make Schedules". www.ocf.berkeley.edu.
11. Dinitz, Jeff (November 13, 2004). "Designing Schedules for Leagues and Tournaments" (PDF). Home Page for Jeff Dinitz. Mount Saint Mary College: GRAPH THEORY DAY 48.
12. Le livre de l'arbitre : édition 2008 (PDF) (in French). Fédération Française des Échecs. 2008. p. 56. ISBN   978-2-915853-01-8.
13. Suksompong, Warut (2016). "Scheduling asynchronous round-robin tournaments". Operations Research Letters. 44 (1): 96–100. arXiv:. doi:10.1016/j.orl.2015.12.008. S2CID   4931332.
14. Table de Berger (in French), examples of round robin schedules up to 30 participants.
15. "C. General Rules and Technical Recommendations for Tournaments / 05. General Regulations for Competitions / General Regulations for Competitions. Annex 1: Details of Berger Table /". FIDE Handbook. FIDE. (contents page)
16. Berger, Johann (1893). Schach-Jahrbuch für 1892/93 (in German). Leipzig. pp. 26–31. OCLC   651254787.
17. Berger, Johann (1899). Schach-Jahrbuch für 1899/1900 : Fortsetzung des Schach-Jahrbuches für 1892/93 (in German). Leipzig. pp. 21–27. OCLC   651254792.
18. Richard Schurig (in French)
19. Schurig, Richard (1886). "Die Paarung der Theilnehmer eines Turniers". Deutsche Schachzeitung (in German). 41: 134–137. OCLC   556959107.
20. Lucas, Edouard (1883). "Les jeux de demoiselles". Récréations Mathématiques (in French). Paris: Gauthier-Villars. pp. 161–197.
21. Ahrens, Wilhelm (1901). "Anordnungs Probleme, Aufgabe 2". Mathematische Unterhaltungen und Spiele (in German). Leipzig: B. G. Teubner. ark:/13960/t2w37mv93.