🧮 Brain Teaser

Successive Wins: Father or Champion in the Middle?

Elmer is promised a prize if he wins at least two tennis sets in a row in a three-set series. His opponents alternate between his father and the club champion. He may choose either order:

  • Father – Champion – Father (F–C–F), or
  • Champion – Father – Champion (C–F–C).

The champion is the stronger player. Let ff be Elmer's probability of beating his father in a set and cc his probability of beating the champion, with 0<c<f<10 < c < f < 1. Assume the sets are independent.

(a) Which order should Elmer choose to maximize his chance of the prize?

(b) Suppose the rule changes to winning at least two of the three sets, consecutive or not. Does the better order change?

Try to guess before computing. Most people's first instinct for (a) is wrong.

independencecounterintuitivebottleneckseries-parallelMosteller

Answer: Successive Wins: Father or Champion in the Middle?

Key Idea / Intuition

To win two sets in a row out of three, Elmer must win the middle set, because both consecutive pairs, (1,2) and (2,3), contain it. The middle set is a bottleneck, so it should be the easiest one, against his father. The outer sets only need one success between them, so facing the champion twice there costs less than it seems. Hence C–F–C is better, even though Elmer plays the champion twice. When the consecutiveness requirement is removed, the bottleneck disappears and the naive intuition (play the weaker opponent more often) is correct again.


Formal Proof / Solution

(a) Two wins in a row

Label the sets 1, 2, 3 with win probabilities p1,p2,p3p_1, p_2, p_3. The event "two consecutive wins" is

(W1∩W2)∪(W2∩W3)=W2∩(W1∪W3).(W_1 \cap W_2) \cup (W_2 \cap W_3) = W_2 \cap (W_1 \cup W_3).

This factorization is the whole trick. By independence,

P=p2 [1−(1−p1)(1−p3)].P = p_2\,\bigl[1 - (1-p_1)(1-p_3)\bigr].

Order F–C–F (p1=p3=f, p2=cp_1 = p_3 = f,\ p_2 = c):

PFCF=c [1−(1−f)2]=cf(2−f).P_{FCF} = c\,\bigl[1-(1-f)^2\bigr] = cf(2-f).

Order C–F–C (p1=p3=c, p2=fp_1 = p_3 = c,\ p_2 = f):

PCFC=f [1−(1−c)2]=fc(2−c).P_{CFC} = f\,\bigl[1-(1-c)^2\bigr] = fc(2-c).

Comparison:

PCFC−PFCF=fc [(2−c)−(2−f)]=fc (f−c)>0.P_{CFC} - P_{FCF} = fc\,\bigl[(2-c) - (2-f)\bigr] = fc\,(f - c) > 0.

So Champion–Father–Champion is strictly better.

Numerical example: with f=0.8f = 0.8 and c=0.4c = 0.4,

PCFC=0.8⋅0.4⋅1.6=0.512,PFCF=0.4⋅0.8⋅1.2=0.384.P_{CFC} = 0.8 \cdot 0.4 \cdot 1.6 = 0.512, \qquad P_{FCF} = 0.4 \cdot 0.8 \cdot 1.2 = 0.384.

(b) At least two wins out of three

Now order is irrelevant except for how many sets are played against each opponent. "At least two of three" means all three wins, or exactly two.

F–C–F (two sets vs. father, one vs. champion):

PFCF′=f2c+f2(1−c)+2f(1−f)c=f2+2fc−2f2c.P'_{FCF} = f^2 c + f^2(1-c) + 2f(1-f)c = f^2 + 2fc - 2f^2c.

C–F–C (two vs. champion, one vs. father):

PCFC′=c2+2fc−2fc2.P'_{CFC} = c^2 + 2fc - 2fc^2.

Comparison:

PFCF′−PCFC′=(f2−c2)−2fc(f−c)=(f−c)(f+c−2fc)=(f−c)[f(1−c)+c(1−f)]>0.P'_{FCF} - P'_{CFC} = (f^2 - c^2) - 2fc(f - c) = (f-c)\bigl(f + c - 2fc\bigr) = (f-c)\bigl[f(1-c) + c(1-f)\bigr] > 0.

So under the relaxed rule, Father–Champion–Father is better, which matches the naive intuition.

Moral

The answer flips because the structure of the winning event changes:

  • "Two in a row" =W2∩(W1∪W3)= W_2 \cap (W_1 \cup W_3). Set 2 is a required "series" component, while sets 1 and 3 are redundant "parallel" components. Put the strongest link (the weaker opponent) where failure is fatal.
  • "Two of three" is symmetric in the sets. Only the multiset of probabilities matters, so you want more easy sets.

The same reliability principle applies in engineering: in a system made of series and parallel parts, put your most reliable component on the series bottleneck.


Source: F. Mosteller, Fifty Challenging Problems in Probability with Solutions, Problem 2 ("Successive Wins"). Part (b) is an added contrast.

Source: Frederick Mosteller, Fifty Challenging Problems in Probability with Solutions, Problem 2 (Successive Wins)

Type: ProbabilitySource: Frederick Mosteller, Fifty Challenging Problems in Probability with Solutions, Problem 2 (Successive Wins)Edit on GitHub ↗