Top Two Meeting in the Final
A single-elimination tournament has $2^n$ players, each with a distinct skill rating. The better player always wins every match, and the winner advances to the next round.
What is the probability that the two highest-rated players meet each other in the final?
Solve this in general for $n$, and then evaluate for $n = 10$ (i.e., 1024 players).
Hints
- Think about the structure of the bracket. What determines whether two players can possibly meet in the final?
- The bracket splits into two halves of size $2^{n-1}$. The two finalists must come from opposite halves.
- Fix the best player in one half. Out of the remaining $2^n - 1$ slots, how many are in the opposite half?
Worked Solution
How to Think About It: A single-elimination bracket splits into two halves. The overall winner comes from one half, the runner-up from the other. For the top two players to meet in the final, they must land in opposite halves of the bracket. If they end up in the same half, the best player eliminates the second-best before the final. So the whole problem reduces to: what is the probability that two specific players are placed in opposite halves of a random bracket?
Quick Estimate: There are $2^n$ slots. Fix the best player in one half. The second-best player is equally likely to be in any of the remaining $2^n - 1$ slots, and exactly $2^{n-1}$ of those are in the opposite half. For $n = 10$, that is $512 / 1023 \approx 0.5005$. Intuitively this is barely above $1/2$ -- almost a coin flip -- because with 1024 players the two halves are nearly equal in size relative to the total.
Approach: Use a direct counting argument on bracket placement.
Formal Solution:
Label the two highest-rated players as $P_1$ (best) and $P_2$ (second best). Because the better player always wins, $P_1$ will win every match on their side of the bracket, and $P_2$ will win every match on theirs -- provided they are in opposite halves.
The bracket has two halves, each with $2^{n-1}$ slots. Fix $P_1$ in one half (by symmetry, this does not affect the probability). There are $2^n - 1$ remaining slots for $P_2$, of which $2^{n-1}$ are in the opposite half.
$$P(\text{top two meet in final}) = \frac{2^{n-1}}{2^n - 1}$$
For $n = 10$:
$$P = \frac{2^9}{2^{10} - 1} = \frac{512}{1023} \approx 0.5005$$
Answer: The probability is $\dfrac{2^{n-1}}{2^n - 1}$. For $n = 10$, this equals $\dfrac{512}{1023} \approx 0.5005$.
Intuition
The key insight is that a single-elimination bracket is really two independent sub-brackets feeding into one final match. The only way the top two players meet in the final is if they start in opposite sub-brackets. Once you see this, the problem becomes a simple counting exercise: fix one player, count the fraction of remaining slots on the other side. The answer $2^{n-1} / (2^n - 1)$ is always just a hair above $1/2$, and it approaches $1/2$ as $n$ grows. That makes intuitive sense -- with a large number of players, the two halves are almost exactly equal in size, so it is almost a coin flip whether the second-best player lands on the same side or the opposite side.
This type of bracket-splitting argument shows up frequently in combinatorics and tournament design problems. The broader lesson is that when you have a recursive or hierarchical structure (like a binary tournament tree), the right move is to think about which level of the tree the event of interest occurs at, and then condition on the partition at that level. It is also a nice example of how symmetry simplifies counting -- by fixing one player's position, you avoid double-counting and reduce the problem to a single ratio.