Skip to content
Vamshi Jandhyala

Books · The Fiddler: Solutions

Chapter 3

How Lucky Can a Baseball Team Get?

↓ Download PDF handout

Two teams of equal skill, the Algebraists and the Geometers, play each other 162162 times over a season. Each game is won by either team with probability 12\tfrac12, independently of every other game.

On average, how many games would you expect the team with the better record to have won?

The Fiddler, Zach Wissner-Gross, August 7, 2026(original post)

The official solution appears in the post of August 14, 2026, which had not been published when this chapter was written. The answers here are my own.

Solution

The teams play nobody but each other, and that is the whole problem. There is only one random quantity in it.

Let XX be the number of games the Algebraists win. Every game has a winner, so the Geometers win the other 162X162 - X, and the better record is max(X,162X)=81+X81.\max(X,\, 162 - X) = 81 + |X - 81| . The two records are not two separate pieces of luck. They are one piece of luck, read forwards and backwards. Whatever the season does, the better record stands as far above 8181 as the worse one stands below it, so the only question left is how far that is.

The answer is therefore 8181 plus the average distance from XX to its own mean, where XBin(162,12)X \sim \operatorname{Bin}(162, \tfrac12). That average distance is the mean absolute deviation, and for a symmetric binomial it has a closed form. For XBin(2m,12)X \sim \operatorname{Bin}(2m, \tfrac12), EXm  =  m4m(2mm).\mathbb{E}\,|X - m| \;=\; \frac{m}{4^{m}}\binom{2m}{m}. The smallest case makes it believable: with 2m=22m = 2 the distance is 1,0,11, 0, 1 with probabilities 14,12,14\tfrac14, \tfrac12, \tfrac14, averaging 12\tfrac12, and the formula gives 1(21)/4=121 \cdot \binom{2}{1}/4 = \tfrac12 too. With 2m=42m = 4 both come to 34\tfrac34.

Setting m=81m = 81,  E[better record]  =  81+812162(16281)  =  86.0699 wins. \boxed{\ \mathbb{E}[\text{better record}] \;=\; 81 + \frac{81}{2^{162}}\binom{162}{81} \;=\; 86.0699 \ \text{wins}.\ }

For large mm the central binomial coefficient satisfies (2mm)/4m1/πm\binom{2m}{m}/4^m \sim 1/\sqrt{\pi m}, so the better record sits about m/π=9/π5.08\sqrt{m/\pi} = 9/\sqrt{\pi} \approx 5.08 games above .500.500. Two teams that are exactly as good as each other finish five games apart, and there is nothing to account for. The gap is what 162162 coin flips look like. A season is long enough to produce a standings table and nowhere near long enough to make one mean anything.

The computation

Playing the season checks the model rather than the algebra, which is the point of doing it at all.

import numpy as np

rng = np.random.default_rng(20260811)
N = 4_000_000
wins = rng.binomial(162, 0.5, N)          # the Algebraists' wins
better = np.maximum(wins, 162 - wins)     # the Geometers win the rest
print(f"{better.mean():.6f}")
# 86.070587       exact value 86.069876

Four million seasons give 86.070686.0706 against the exact 86.069986.0699.

The mean absolute deviation formula deserves its own check, since the whole answer rests on it. Summing k81(162k)/2162|k - 81|\binom{162}{k}/2^{162} over all 163163 outcomes in exact rationals returns precisely 81(16281)/216281\binom{162}{81}/2^{162}, as an equality of fractions and not merely to within rounding.

Extra Credit

Now there are 3030 teams of equal skill, and each team plays each other team five times, so each plays 145145 games in all. On average, how many games would you expect the team with the best record to have won?

Solution

Two things about a single team survive the move to a league. One does not.

Each team’s 145145 games are still 145145 independent fair coin flips as far as that team is concerned, so the marginal law is exactly WiBin(145,12)W_i \sim \operatorname{Bin}(145, \tfrac12), with mean 72.572.5 and variance 1454=36.25\tfrac{145}{4} = 36.25. Nothing has changed there.

What breaks is independence. The (302)=435\binom{30}{2} = 435 pairings supply 21752175 games, each game hands out exactly one win, and so W1+W2++W30  =  2175in every season.W_1 + W_2 + \cdots + W_{30} \;=\; 2175 \quad \text{in every season.} A sum with no randomness in it has no variance, which pins the correlation without any argument about shared games: 301454  +  3029Cov(Wi,Wj)  =  0,Cov(Wi,Wj)=54,Corr(Wi,Wj)=129.\begin{gather*} 30 \cdot \tfrac{145}{4} \;+\; 30 \cdot 29 \cdot \operatorname{Cov}(W_i, W_j) \;=\; 0, \\ \operatorname{Cov}(W_i, W_j) = -\tfrac54, \qquad \operatorname{Corr}(W_i, W_j) = -\tfrac{1}{29}. \end{gather*} The direct count agrees: two teams meet five times, in those games one team’s wins are the other’s losses, and their remaining games are independent, so the covariance is that of five fair games with itself reversed, namely 54-\tfrac54.

A maximum depends on the joint law and not on the margins, and this joint law does not factorise. There is no closed form here, and inventing one is the only real error the problem offers. The value comes from playing the league out:  E[best record]    84.98 wins. \boxed{\ \mathbb{E}[\text{best record}] \;\approx\; 84.98 \ \text{wins}.\ }

Independence is not a harmless simplification

The tempting shortcut is to treat the thirty teams as thirty separate 145145-game seasons. That model is exactly computable, since a maximum of independent variables has distribution function F(k)30F(k)^{30}: E[best]  =  k0(1F(k)30)  =  84.7711,F=the c.d.f. of Bin(145,12).\begin{gather*} \mathbb{E}[\text{best}] \;=\; \sum_{k \ge 0}\bigl(1 - F(k)^{30}\bigr) \;=\; 84.7711, \\ F = \text{the c.d.f. of } \operatorname{Bin}(145, \tfrac12). \end{gather*} It is 0.210.21 wins short. The shortfall is small, but its sign is the interesting part, and it is the opposite of what most people guess. Negative correlation sounds as though it should hold the leader back, since a team can only climb by pushing others down. It does the reverse, because the pushing down is exactly the point.

Three facts settle it, none of them requiring the joint law. Every team still has variance 36.2536.25, so no team is more erratic in one model than the other. But within a season the thirty records lie further apart in the round robin: for exchangeable variables with correlation ρ\rho the expected sample variance is σ2(1ρ)\sigma^2(1 - \rho), and ρ=1/29\rho = -1/29 gives 36.25×3029=37.5against36.25.36.25 \times \tfrac{30}{29} = 37.5 \qquad\text{against}\qquad 36.25 . And the centre they are spread around never moves: the mean record is exactly 72.572.5 in every round-robin season, while under independent schedules it wanders with a standard deviation of about 1.11.1 wins. The round robin pins the middle of the table and forces the ends apart, which lifts the top of it. The same pinning is why the best record is also less variable, standard deviation 2.812.81 against 2.982.98: the leader is being measured from a centre that cannot drift.

The best record in a 3030-team round robin, against the same thirty teams playing independent 145145-game seasons. Same margins, same variance per team, different joint law. At the top the two curves are almost indistinguishable, which is the honest impression, since the effect is a fifth of a win. The lower panel is their difference, where the structure is plain: probability comes off the low records, below about 8282, and lands on the middle and upper ones, from 8383 to about 8989. A rightward shift, not a fattening of the tails.

The two-team case proves the direction, because there the coupling is total and both numbers are exact. The puzzle itself gives 86.069986.0699. Had the Algebraists and Geometers instead each played 162162 games against the rest of the world, the better of their two records would average 81+12EXY  =  81+812324(324162)  =  84.5877,81 + \tfrac12\,\mathbb{E}\,|X - Y| \;=\; 81 + \frac{81}{2^{324}}\binom{324}{162} \;=\; 84.5877 , where XY+162Bin(324,12)X - Y + 162 \sim \operatorname{Bin}(324, \tfrac12) turns a difference of two binomials back into a single one. The excess above .500.500 is 5.06995.0699 against 3.58773.5877, a ratio of 1.41311.4131, and the asymptotics say where it is going: m/π\sqrt{m/\pi} against m/2π\sqrt{m/2\pi}, a factor of exactly 2\sqrt2. With two teams the correlation is 1-1 and the mechanism runs at full strength. With thirty it is diluted to 1/29-1/29, and the same effect survives at a fifth of a win.

The computation

Two encodings, written separately, so that a plausible bug cannot agree with itself. The first draws a Bin(5,12)\operatorname{Bin}(5, \tfrac12) for each pairing. The second flips all 21752175 games one at a time. Both assert that every game has been accounted for before the maximum is taken.

import numpy as np

T, PER = 30, 5
pairs = [(i, j) for i in range(T) for j in range(i + 1, T)]
rng = np.random.default_rng(20260811)

M = 4_000_000
W = np.zeros((M, T), dtype=np.int16)
for i, j in pairs:
    d = rng.binomial(PER, 0.5, M).astype(np.int16)
    W[:, i] += d
    W[:, j] += PER - d
assert (W.sum(axis=1) == len(pairs) * PER).all()

best = W.max(axis=1)
print(f"{best.mean():.4f}")
# 84.9816     standard error 0.0014

Four million leagues give 84.981684.9816 with a standard error of 0.00140.0014. The game-by-game encoding gives 84.979684.9796 over four hundred thousand leagues, agreeing to within its own noise. The same runs confirm the two structural claims made above, returning a within-season sample variance of 37.4737.47 against the predicted 37.537.5, and a season mean record of 72.572.5 with no variation at all.