Tool/Generator to make trees of elimination/knockout tournaments from a list and taking into account any available seeds of the first rounds of the tournament.
Tournament Tree Generator - dCode
Tag(s) : Algorithm, Combinatorics
dCode is free and its tools are a valuable help in games, maths, geocaching, puzzles and problems to solve every day!
A suggestion ? a feedback ? a bug ? an idea ? Write to dCode!
Tournament Tree Generator
Tournament Tree Generator
Answers to Questions (FAQ)
What is a single elimination tournament? (Definition)
A knockout tournament is a competition eliminating any competitor/team that loses a match. The winner is then the team/competitor who does not lose any matches.
How to organize a single elimination tournament?
Make a list of all participants, if necessary taking into account a prior ranking of players / teams (for a tournament with seed) otherwise a random sort will be done.
Ideally, the number of teams is a number equal to a power of $ 2 $ such as $ 4, 8, 16, 32, 64, 128, 256 $, if not, some match will not have 2 opponents (Teams / players will then automatically qualify in the next round).
Click Generate to get the tournament games' tree.
What are tournament seeds?
In a tournament, to increase the show and the suspense, the first rounds are not completely random. To prevent 2 favorites/contenders face each over in the first rounds and be quickly eliminated, the seeds (the best players from a previous ranking or tournament) are slightly helped and can not meet immediately, they must first beat other players (theoretically less well ranked) before reaching the final stages.
Example: Grand Slam tennis matches (Roland Garros, Wimbledon, etc.) use seeds
How many total games has a tournament?
For a knockout tournament competition with $ N $ teams then there is a total of $ N-1 $ matches.
Indeed, every game, a team is eliminated, so in the end only one team will never lose, so there will have been $ N-1 $ games.
Example: In a 32-team tournament, there are 31 matches (sometimes 32 when a game is played for 3rd place)
Source code
dCode retains ownership of the "Tournament Tree Generator" source code. Any algorithm for the "Tournament Tree Generator" algorithm, applet or snippet or script (converter, solver, encryption / decryption, encoding / decoding, ciphering / deciphering, breaker, translator), or any "Tournament Tree Generator" functions (calculate, convert, solve, decrypt / encrypt, decipher / cipher, decode / encode, translate) written in any informatic language (Python, Java, PHP, C#, Javascript, Matlab, etc.) or any database download or API access for "Tournament Tree Generator" or any other element are not public (except explicit open source licence). Same with the download for offline use on PC, mobile, tablet, iPhone or Android app.
Reminder: dCode is an educational and teaching resource, accessible online for free and for everyone.
Cite dCode
The content of the page "Tournament Tree Generator" and its results may be freely copied and reused, including for commercial purposes, provided that dCode.fr is cited as the source (Creative Commons CC-BY free distribution license).
Exporting the results is free and can be done simply by clicking on the export icons ⤓ (.csv or .txt format) or ⧉ (copy and paste).
To cite dCode.fr on another website, use the link:
In a scientific article or book, the recommended bibliographic citation is: Tournament Tree Generator on dCode.fr [online website], retrieved on 2025-07-12,
