The Structure of Fair Competition

A single-elimination bracket is the simplest tournament format: lose once and you are out. For 8 participants, the bracket requires 7 total matches across 3 rounds to produce a single champion. The structure is a complete binary tree. Each internal node represents a match, each leaf represents a participant, and the root represents the final. The number of matches is always one fewer than the number of participants because every match eliminates exactly one competitor.

Why Random Seeding Matters

In organized tournaments, seeding uses rankings to separate top competitors into different bracket halves, ensuring they meet only in later rounds. Random seeding inverts this logic: every participant has equal probability of landing in every bracket position. This creates maximum uncertainty and fairness when no prior ranking exists. Classroom debates, office game nights, pickup tournaments, and casual competitions all benefit from purely random seeding because no human judgment or bias influences who faces whom.

Powers of Two and BYEs

A bracket works cleanly when the participant count is a power of two: 4, 8, 16, 32, 64. When the count falls between powers, some participants receive a BYE, advancing to round two without playing. This tool rounds up to the next power of two and distributes BYEs evenly. With 8 participants (a perfect power of two), every slot is filled with zero BYEs.

In the Classroom

Brackets make combinatorics visible. Ask students: for a 16-participant bracket, how many total matches occur? (15.) How many rounds? (4.) If you double the participants, how many additional rounds? (Just one.) This logarithmic relationship between participants and rounds is a concrete example of how efficiently binary structures scale. Generate a bracket at /bracket/16 and have students verify the structure.

Private by Architecture

The seeding shuffle runs entirely inside your browser using the Web Cryptography API. Fisher-Yates shuffle with hardware-seeded randomness guarantees every permutation is equally probable. The server delivers the page. Your device creates the seeding. No participant data or bracket state ever leaves your browser.