Round-Robin Games Calculator

Work out how many matches and rounds a single round-robin needs from the number of teams.

Result

45
9

How it is calculated

The input is t, the number of teams, which must be a whole number of at least 2. The tool assumes a single round-robin, where each pair meets once. Total matches: M = t × (t − 1) / 2. Rounds: t − 1 when t is even, because every team can play in every round, and t when t is odd, because one team has a bye in each round. The tool does not output the pairings or the number of matches per round, only the two totals. For a double round-robin (home and away) the match and round counts are simply doubled. A decimal such as 7.5, a single team, zero or a negative number gives no result rather than a rounded one.

Worked example

A league has t = 10 teams. Each team plays the other 9, so there are 10 × 9 = 90 team-appearances; every match involves two teams, so 90 / 2 = 45 matches. Ten is even, so nobody needs a bye and the schedule fits into 10 − 1 = 9 rounds, with 5 matches in each round (5 × 9 = 45). The tool shows 45 matches and 9 rounds. With 11 teams you would get 55 matches but 11 rounds, because one team sits out every round.

Try this example →

Common mistakes

  • Entering a team count and expecting a double round-robin. The result is for each pair meeting once; if teams play home and away, double both numbers.
  • Assuming rounds equal matches divided by teams. With an odd number of teams one team rests each round, so the round count equals the team count, not one less.
  • Counting a bye as a match. Byes are rest rounds and are not included in the match total.
  • Using the total as a per-team figure. The 45 matches are the whole league; each team plays only t − 1 = 9 of them.
  • Entering a number of players or a count with a fraction, such as 7.5. The tool wants a whole number of teams and shows nothing otherwise, so round it yourself and decide whether the odd team gets a bye.

About this calculator

In a single round-robin tournament, every team plays every other team exactly once. The total number of matches follows directly from combinatorics: with n teams, the number of unique pairings is n(n−1)/2 — the same formula used to count handshakes in a room. If n is even, the tournament fits into n−1 rounds with every team playing simultaneously each round; if n is odd, one team sits out (a bye) each round, pushing the schedule to n rounds.

League organizers, chess tournament directors, and school or corporate event planners use this formula to build fixture schedules and estimate how many days or weeks a competition will take before a single game is scheduled. It is also the reference point coaches and administrators use when comparing a round-robin format’s fairness (every team faces every opponent) against a faster knockout bracket, which needs far fewer matches but eliminates teams early.

Was this helpful?

You can pick up to 3 reactions.

Comments

  • Be the first to comment.

Popular calculators

All Calculators