Tournament Bracket Calculator
Calculates the minimum number of single-elimination rounds needed to crown a champion from a given number of participants. Use it when designing chess Swiss-knockouts, board-game tournaments, esports brackets, or any single-elimination event.
Last updated: May 2026
Compare with similar
About this calculator
In a single-elimination tournament, each round halves the field by eliminating losers, so the total number of rounds equals the binary logarithm of the participant count rounded up: rounds = ⌈log₂(participants)⌉. Variables: participants (count of entrants). For powers of 2 (8, 16, 32, 64...), the bracket fits perfectly — 8 → 3 rounds, 16 → 4 rounds, 32 → 5 rounds, 64 → 6 rounds, 128 → 7 rounds (a typical Major esports event). When participant count is not a power of 2, byes (free advancements in the first round) are awarded to the top-seeded players so that round 2 contains exactly a power-of-2 number of players. Edge cases: this formula gives the minimum rounds for pure single elimination. Double-elimination (used in fighting games, Dota 2 Majors) requires roughly 2 × log₂(N) − 1 rounds because losers move to a losers bracket. Swiss-system tournaments (chess, MTG) use log₂(N) rounds as a target but can run with fewer for shorter events. Round-robin tournaments have N − 1 rounds (each player plays every other). The formula doesn't account for ties (extra tiebreaker rounds), seeded byes (which create asymmetry in player paths), or 'best-of-N' match formats (a 7-round bracket of best-of-5 matches takes much longer in real time than 7 single games). For board-game tournaments with no draws (like Catan or Codenames Duet), single elimination works directly; for chess where draws are common, draws must be broken by tiebreaker games (rapid → blitz → Armageddon) or alternative pairing systems.
How to use
Example 1: 64 participants in a chess knockout. Step 1: log₂(64) = 6 (since 2^6 = 64). Step 2: ⌈6⌉ = 6 rounds. Verify: round 1 has 32 games (64 → 32), round 2 has 16 (32 → 16), round 3 has 8, round 4 has 4 (quarterfinals), round 5 has 2 (semifinals), round 6 has 1 (final). Total 6 rounds, matching the formula. Example 2: 100 participants. Step 1: log₂(100) ≈ 6.644. Step 2: ⌈6.644⌉ = 7 rounds. Verify: 7 rounds can accommodate up to 2^7 = 128 players. The 28 extra slots (128 − 100) are filled by giving 28 top-seeded players first-round byes; 72 players play 36 first-round matches, joining the 28 bye-recipients in round 2's 64-player field, then halving each round to a single champion in round 7.
Frequently asked questions
How many rounds does a single-elimination tournament need?
The number of rounds equals the binary logarithm of the participant count rounded up: rounds = ⌈log₂(N)⌉. For 8 players you need 3 rounds, 16 players need 4 rounds, 32 need 5, 64 need 6, 128 need 7, 256 need 8, and so on. Each round halves the remaining field until one champion remains. For participant counts that aren't powers of 2, byes are awarded so that round 2 starts with exactly a power-of-2 number of players. The total number of matches played across all rounds equals N − 1, since every loss eliminates exactly one player and you need to eliminate all but the winner.
What is a 'bye' in a tournament and when are they used?
A bye is a free advancement to the next round, awarded when the participant count is not a power of 2. For example, in a 100-player tournament needing 7 rounds (2^7 = 128 slots), 28 players receive first-round byes and skip directly to round 2; the remaining 72 players play 36 first-round matches. Byes are typically given to the top-seeded players (by rating, ranking, or qualification) to reward them for the seed. In Swiss-system tournaments, byes are also assigned when a round has an odd number of players, and the bye-recipient typically scores 1 point (a 'full-point bye') though some events use half-point or zero-point byes. Byes give the bye-recipient one less game played, which can be either an advantage (rest, no risk) or a disadvantage (no playing momentum, no rating gain).
How is a double-elimination bracket different from single-elimination?
In single-elimination, one loss eliminates a player. In double-elimination, a loss moves the player to a losers bracket where they can fight back to the grand final; only the second loss eliminates them. Double-elimination requires roughly 2 × log₂(N) − 1 rounds — for 16 players, that's 7 rounds versus 4 for single-elimination. The advantage is that no one is eliminated by a single bad game or upset — fairer for tournaments with high variance (fighting games, Dota 2 esports). The disadvantage is much longer event duration and a 'bracket reset' rule controversy in the grand final (the loser-bracket finalist must beat the winner-bracket finalist twice to win). Most professional esports (Dota 2 The International, fighting game majors) use double elimination; most chess and tennis events use single elimination or Swiss-then-knockout hybrids.
What are common mistakes when planning tournament brackets?
Confusing log₂(N) with log₁₀(N) — the binary log is much smaller; 1,000 participants need 10 rounds (log₂ = 9.97), not 3 (log₁₀ = 3). Forgetting that single-elimination doesn't give all players an equal number of games — half the field plays only 1 game, while finalists play log₂(N) games. Designing a single-elimination bracket for chess where draws are common — half the matches would tie and need rapid/blitz tiebreaks (use Swiss with knockout finals instead). Not accounting for 'best-of-N' match formats — a 7-round Bo3 bracket takes 21 games per finalist, plus losers' bracket games if double-elimination. Forgetting that seeding affects competitive fairness — a 1-vs-16 first-round match is much easier than a 1-vs-8 match. Scheduling all rounds without rest days for long events (fatigue is significant after 5+ classical chess games). Ignoring third-place playoff scheduling — in single-elimination, the two semifinal losers may or may not play for 3rd place, and bracket logistics differ.
When should I NOT use single-elimination bracket math?
For events with high draw rates (chess classical, slow board games), single elimination requires tiebreaker games and becomes time-prohibitive — use Swiss-system or round-robin instead. For events with many participants but short time (1-day tournaments), Swiss-system fits more games in less time while ranking all participants meaningfully. For team-based events (basketball, soccer leagues), round-robin or seeded group-stage + knockout hybrids work better. For events where seeding matters greatly (top seeds shouldn't meet early), use bracket designs that separate top seeds into different quarters. For continuous-rating events (online ladder, ELO progression), tournament brackets don't apply — players gain or lose rating per game. For 'last-man-standing' formats (battle royale), final-table rankings don't follow elimination math directly. Multi-stage events (group stage → playoffs) need separate calculation per stage. For 1-elimination chess like the World Cup, account for tiebreak time controls (rapid → blitz → Armageddon) which extend nominal round counts. Finally, online matchmaking and ranked ladder systems use different mathematics entirely (Elo, Glicko, TrueSkill).