You can solve this puzzle in about two seconds, without drawing a single bracket. But almost everybody starts the long way round.
Here's the puzzle:
100 tennis players enter a knockout tournament. In every match, one player wins and one player loses, and the loser goes home. If there's an odd number of players left in a round, one lucky player gets a bye (a free pass into the next round). The last player standing is the champion.
How many matches are played altogether?
Grab a pencil and have a go before you read on. No racket required.
Stop and Think
Stuck? Here are three hints. Try to use them one at a time.
Hint 1: You could draw the whole bracket and count the matches round by round. But that's slow, and it gets messy when the numbers turn odd.
Hint 2: Instead of counting matches, count something else. Something that's much easier to count.
Hint 3: Think about the players who lose. What happens to each of them?
Still thinking? Good. That's the fun part. Read on when you're ready.
The Long Way
Let's do it the slow way first, round by round:
Round 1: 100 players → 50 matches → 50 players left
Round 2: 50 players → 25 matches → 25 players left
Round 3: 25 players → 12 matches (one player gets a bye) → 13 left
Round 4: 13 players → 6 matches (another bye) → 7 left
Round 5: 7 players → 3 matches (another bye) → 4 left
Round 6: 4 players → 2 matches → 2 left
Round 7: 2 players → 1 match → 1 champion!
Now add up all the matches:
50 + 25 + 12 + 6 + 3 + 2 + 1 = 99 matches
So the answer is 99. Phew! That was a lot of work, and one slip in the middle (like forgetting a bye) and the whole answer goes wrong.
The Two-Second Way
Now for the big "aha". Forget the rounds. Think about the losers.
Every single match has exactly one loser, and that player is out of the tournament. They never play again.
And the tournament ends when there is just one player left: the champion. That means 99 players have to lose, and each of them loses exactly once, in exactly one match.
99 players have to lose → 99 matches. Done!
Each match creates exactly one loser, and we need exactly 99 losers. So there have to be exactly 99 matches. It doesn't matter how the brackets are drawn, how many rounds there are, or who gets the byes. You never even needed to know what a round was.
Does It Always Work?
Try some small tournaments, and count the matches the long way:
2 players → 1 match
3 players → 2 matches (two play, then the winner plays the third)
4 players → 3 matches
8 players → 7 matches
64 players → 63 matches
It's always one fewer than the number of players, because everyone except the champion has to lose once. We even got a computer to check every tournament size from 2 to 2,000 players, with the byes put in randomly. The number of matches was always the number of players minus one.
Try It Yourself
A giant tournament. If 1,000 players enter, how many matches? (No need to draw a bracket!)
A school tournament. Your class has 30 players in a knockout chess tournament. How many games will be played?
Check your answers: 999 matches for the giant tournament, and 29 games for the chess tournament.
A different kind of tournament. What if instead everyone plays everybody else once, with no one going home? Now it gets big fast. With 10 players, each of the 10 plays 9 others, but every match is counted twice (once for each player), so:
10 × 9 ÷ 2 = 45 matches
And with 100 players:
100 × 99 ÷ 2 = 4,950 matches
So finding a champion by knockout takes 99 matches, but letting everyone play everyone takes 4,950. (If that "counting pairs" trick looks familiar, it's the same one that cracked The Birthday Problem.)
The OddMaths Takeaway
When counting is messy, count something else. Counting matches means keeping track of rounds, byes and brackets. Counting losers is easy: every player except the champion loses exactly once, so there are always one fewer matches than players.
A lot of puzzles that look hard turn out to have an easier question hiding inside them. The trick is to ask, "What's the thing that's easy to count?"