Tournament Tree Generator

Make a list of all participants, if necessary taking into account a prior ranking of players / teams (for a tournament with seed).

Ideally, the number of team 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.

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).

Example: Grand Slam tennis matches (Roland Garros, Wimbledon, etc.) use seeds

For a knockout tournament with $ N $ teams then there is a total of $ N-1 $ match.

Indeed, every game, a team is eliminated, so in the end only one team will never lost, 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)