Bracket and Fixture Scheduling Maths
Byes, seeding, and the circle method that fits a full round-robin into n-1 rounds.
There are two standard ways to run a competition where everyone should get a fair shot: eliminate people until one is left, or have everyone play everyone. They have completely different arithmetic, and the arithmetic is usually what decides which format fits the time available.
A single-elimination bracket for sixteen entrants is fifteen matches across four rounds. A round-robin for the same sixteen is a hundred and twenty matches across fifteen rounds. That is the whole decision, and it is not close.
This page covers where byes go, what seeding actually protects, and the circle method that fits a round-robin into the minimum number of rounds.
Why brackets need powers of two
Every round of a single-elimination bracket halves the field. Sixteen becomes eight becomes four becomes two becomes one. That only works cleanly when the starting field is a power of two, because any other number produces a round where somebody has no opponent.
The total number of matches is easier than it looks: every match eliminates exactly one entrant, and all but one entrant must be eliminated, so a field of n needs exactly n−1 matches regardless of byes. Sixteen entrants is fifteen matches; twelve entrants is eleven.
The number of rounds is the base-2 logarithm of the padded field size. A 16-slot bracket is four rounds; a 32-slot bracket is five. Doubling the field adds one round, which is why brackets scale so well for large fields and why they are the format of choice when time is short.
Field sizes and their brackets
- 12 entrants → 16-slot bracket, 4 byes, 11 matches, 4 rounds.
- 16 entrants → 16-slot bracket, 0 byes, 15 matches, 4 rounds.
- 20 entrants → 32-slot bracket, 12 byes, 19 matches, 5 rounds.
- Matches are always n−1; only the rounds and byes change.
Where byes should go, and what they are worth
A bye is a free pass to the second round, and it is a real competitive advantage: one fewer match to lose, and one fewer match of fatigue on the way to the final. In a 16-slot bracket with four byes, a seeded entrant plays three matches to reach the final while an unseeded one plays four.
Conventional practice gives byes to the top seeds, on the reasoning that the strongest entrants are least likely to be eliminated early anyway so the advantage changes the outcome least. That is a defensible argument and it is also the one that most benefits the entrants who need it least.
In an unseeded draw the byes fall at random, which is fairer in the sense that everyone has the same chance of one, and produces more upsets in the second round because a rested unknown meets a tired favourite.
What seeding actually protects
Seeding is not about giving the best entrant an easier path — it is about protecting the later rounds. In a blind sixteen-entrant draw, the two strongest entrants meet in round one about one time in fifteen, and two of the top four meet in round one considerably more often than that.
When that happens the tournament has spent its best match in the first round and the final is between an entrant who beat a favourite and one who did not have to. Seeding places the top entrants in opposite halves so they cannot meet before the semi-final, and the top two in opposite quarters so they cannot meet before the final.
The cost is that seeding is only as good as the ranking behind it. A wrongly seeded field is worse than an unseeded one, because it concentrates the error: putting a strong entrant at seed 12 guarantees they meet seed 5 early, which an unseeded draw would only do by chance.
- Seeding protects the later rounds, not the strongest entrant's path.
- It requires a ranking you actually trust — a bad seeding is worse than none.
- It reduces randomness deliberately, which is the trade being made.
- In an unseeded 16-field, two of the top four meet in round one surprisingly often.
The circle method for round-robins
A round-robin needs every entrant to play every other exactly once, in as few rounds as possible. The circle method achieves the minimum with a simple physical picture: arrange the entrants in a circle, fix one in place, and rotate all the others one position each round.
In each round, the fixed entrant plays whoever is directly opposite, and everyone else pairs off across the circle. After one complete rotation, every pair has met exactly once. For an even field of n, that takes n−1 rounds; for an odd field, add a phantom entrant and whoever draws it has a bye, giving n rounds.
That n−1 is provably minimal. Each entrant must play n−1 matches and can play at most one per round, so no schedule can be shorter. The circle method achieves the bound exactly, which is why it has been the standard construction for over a century.
Round-robin sizes
- 6 entrants: 15 fixtures across 5 rounds, 3 matches per round.
- 8 entrants: 28 fixtures across 7 rounds, 4 matches per round.
- 16 entrants: 120 fixtures across 15 rounds — a season, not an afternoon.
- Fixtures = n(n−1)/2, which grows quadratically while bracket matches grow linearly.
Choosing between them
The deciding factor is almost always time. A bracket for sixteen finishes in four rounds and eliminates half the field immediately; a round-robin for sixteen is fifteen rounds and nobody goes home early. For a one-day event above about eight entrants, a round-robin is not an option.
The deciding factor for fairness runs the other way. A bracket can eliminate the second-best entrant in round one and never find out; a round-robin cannot, because everyone plays everyone. If the goal is to identify the genuinely strongest entrant rather than to produce a champion by a deadline, round-robin is the better instrument.
The common compromise is round-robin groups feeding a bracket, which is what most large tournaments do: it bounds the fixture count while still giving every entrant several matches, and it produces a seeded bracket from real results rather than from guesses.
Frequently asked questions
How many matches does a bracket need?
Exactly n−1, regardless of byes, because every match eliminates one entrant and all but one must be eliminated.
How many byes will my field need?
The next power of two minus your field size. Twelve entrants need a 16-slot bracket, so four byes.
Is a bye a real advantage?
Yes — one fewer match to lose and one fewer match of fatigue. In a 16-slot bracket with four byes, a seed plays three matches to the final instead of four.
What does seeding protect?
The later rounds. It stops the strongest entrants meeting early, which would spend the best match of the tournament in round one.
Is a badly seeded bracket worse than an unseeded one?
Yes. Seeding concentrates the ranking error, so a strong entrant placed at seed 12 is guaranteed a hard early match rather than merely risking one.
How many rounds does a round-robin take?
n−1 for an even field and n for an odd one, and that is provably the minimum — each entrant plays n−1 matches and can play at most one per round.
How many fixtures is a round-robin?
n(n−1)/2. Eight entrants is 28 matches; sixteen is 120, which is a season rather than a day.
Which format should I choose?
Bracket if time is short or the field is large; round-robin if identifying the strongest entrant matters more than finishing today. Groups feeding a bracket is the standard compromise.
Tools that use this
Tournament Bracket Generator
Draw a single-elimination bracket with byes — random draw or classic seeding.
Round-Robin Schedule Generator
Everyone plays everyone once, in the fewest rounds — by the circle method.
Random Pair Generator
Split a list into pairs — with an honest answer for what happens on an odd count.
Related guides
Constraint Satisfaction in Fair Draws
What happens when the rules and the randomness disagree — and when there is no answer.
Randomness in the Classroom: A Primer
Where random selection helps a lesson, where it hurts one, and what teachers report.
How Shuffling Actually Works
Fisher-Yates, one swap at a time, and why it is the only shuffle worth using.