To solve this problem we can, without loss of generality, think of the first player as being at the top of the draw. We MUST also assume that the chances of winning any given match is 1/2. Then the chance of the players meeting in the first round (with 2ⁿ participants) is p=1/(2ⁿ - 1).

The chances of the two players not meeting in the first round and winning their first round matches is:

(1 - 1 2n - 1 )× 1 4 = 2n-1-1 2(2n - 1) .

It follows that the chance of the two players being drawn to meet in the second round is:

2n-1-1 2(2n - 1) × 1 (2n-1 - 1) = 1 2(2n-1) = p 2 .

So the odds of them meeting in the second round is half those of meeting in the first round. By the same reasoning the probability of meeting in each subsequent round is half the probability of meeting in the previous round.

For 2ⁿ paricipants there will be n rounds, so we can sum ALL the probabilities of meeting in a certain round, and we get

1 2n - 1 æ ç è 1 1 + 1 2 + 1 4 + ¼ 1 2n-1 ö ÷ ø = 1 2n - 1 æ ç è 2- 1 2n-1 ö ÷ ø = 1 2n - 1 æ ç è 2n - 1 2n-1 ö ÷ ø = 1 2n-1 .

So the probability of the two players meeting if there are 2ⁿ players competing is

1 2n-1

.