Top Two Seeds Meet in the Final
A knockout chess tournament has players with distinct ratings, drawn into a uniformly random bracket of rounds. In every match the higher-rated player always wins and advances. Find the probability that the two highest-rated players meet in the final.
Work it out, then compare with the answer.
SolutionShow the worked solution
Since nobody can beat the top seed , wins every match and always reaches the final. The final is played between the winners of the two halves of the bracket, each of slots.
- If the second seed is in the other half from , then is the strongest player in that half. So wins that half and meets in the final.
- If is in the same half as , the two must meet before the final, and is knocked out.
The bracket is uniformly random. So, given ’s slot, is equally likely to occupy any of the other slots. Exactly of these lie in the opposite half. Hence
Key idea. The top seed always reaches the final, so only the second seed’s half of the bracket matters.
Variations
The same idea with a twist. Each solution gives only the changed step.
A knockout chess tournament has players with distinct ratings, drawn into a uniformly random bracket of rounds. In every match the higher-rated player always wins and advances. Find the probability that the highest-rated and third-highest-rated players meet in the final.
Work it out, then compare with the answer.
Solution
As before, always reaches the final. The third seed reaches the final exactly when two things hold:
- is in the other half from , where it must then be the strongest player;
- is not in ’s half, so must be in ’s half.
Given ’s slot, lands in ’s half with probability . Given that, lands in the other half with probability . Therefore
A knockout chess tournament has players with distinct ratings, drawn into a uniformly random bracket of rounds. In each match the higher-rated player wins with probability , where , and advances. Express, as a function of and , the probability that the second-highest-rated player beats the highest-rated player in the final. Evaluate this function at , .
Work it out, then compare with the answer.
Solution
For and to meet in the final, they must start in opposite halves. This happens with probability .
Given this, is the higher-rated player in each of its matches within its half, so it wins all of them with probability .
is absent from ’s half, so is likewise the higher-rated player in each of its matches. It wins them all with probability , independently of ’s results.
In the final, beats with probability . Hence
At and :