Probability the Two Strongest Teams Meet in a 16-Team Knockout Final

Sixteen teams, each with a distinct skill level, are placed at random into the 16 initial positions of a predetermined single-elimination bracket. The tournament consists of four rounds: the 16 teams compete in 8 first-round matches, the 8 winners advance to 4 quarterfinals, the 4 survivors play 2 semifinals, and the two semifinal victors face off in the final. In each game, the stronger team wins with probability 0.9, independent of all other games. What is the probability that the two strongest teams end up meeting in the final?

Hint: Separate placement from play. First determine which initial slot assignments make a final meeting possible. Then figure out how many games each of the two teams must win, and what opponents they might encounter on the way.

Constraints and Clarifications

• All assignments of the 16 teams to the 16 slots are equally probable.
• The bracket is fixed: subsequent-round pairings are dictated by slot positions, with no reseeding between rounds.
• The 0.9 win probability holds for every game, irrespective of the skill gap between the two teams.
• Provide an exact expression and a decimal approximation.

What a Strong Answer Covers

• The structural condition on starting slots that allows two teams to meet only in the final, and the probability of that placement.
• The number of games each team must win and the possible opponents it could face before the final.
• A justified independence argument when combining the placement probability with the game outcomes.
• An exact final value along with a sanity check, for instance the limiting case where the stronger team always wins.

Follow-up Questions

1. What is the probability that the strongest team wins the tournament?
2. Generalize the answer to a bracket with $n = 2^k$ teams, where the stronger team wins each game with probability $p$.
3. How would the answer change if the bracket were seeded such that the two strongest teams always start in opposite halves?

Overview: Probability puzzle involving a 16-team single-elimination bracket with random slot assignment, where the stronger team wins each game with probability 0.9. It asks for the chance that the two strongest teams meet in the final, testing conditioning on bracket structure, independence of game outcomes, and careful counting.

Read the full DRW Quantitative Researcher interview experience this question came from

Community answers Answer by orange.ao2538

They must be placed in different halves; otherwise, only one team per half can reach the final, so they cannot meet in the final if they are in the same half.

$P(\text{different halves}) = \frac{\binom{2}{1}\binom{14}{7}}{\binom{16}{8}} = \frac{8}{15}$

each must win all 3 games before the final $\Rightarrow (0.9^3)^2 = 0.9^6$

$\Rightarrow P(\text{meet in final}) = \frac{8}{15} \cdot 0.9^6 = 0.283$

$P(\text{the strongest team wins the tournament}) = 0.9^4 = 0.6561$, regardless of the assignment; we just need the strongest team to win all 4 matches.

For $n = 2^k$ teams, each winning with probability $p$...

$P(\text{different halves}) = \frac{\binom{2}{1}\binom{2^k-2}{2^{k-1}-1}}{\binom{2^k}{2^{k-1}}} = \frac{2^{k-1}}{2^k-1}$

$P(\text{win all } k-1 \text{ games before the final}) = p^{2k-2}$

so, $P(\text{meet in the final}) = \frac{(2p^2)^{k-1}}{2^k-1}$

If the two strongest teams always start in different halves, then they only both need to win all $k-1$ matches

$\Rightarrow P = p^{2k-2}$