Loading...
In 2018, Kai joins an online chess platform rated 1200—the default for new players. He's actually much stronger, having studied tactics for years offline. His first opponent, Mira, is rated 1450. The system calculates Kai's expected score: using the Elo formula, a 250-point gap gives him roughly a 15% win probability. Kai wins. Because the system expected him to lose, his rating jumps 13 points to 1213, while Mira drops only 13. The system has updated its belief about Kai's strength based on new evidence. Over the next 30 games, Kai tears through opponents. He beats a 1500, a 1600, even a 1750. Each upset produces a large rating swing because the system assigned low probability to his victories. By game 30, he's climbed to 1680. But something shifts. He loses to a 1620-rated player name...
Popular framing: He just got lucky with easy opponents, then his real level caught up.
Structural analysis: Elo is a Bayesian update engine: each result is weighted by how surprising it was given the prior, so early upsets produce large swings and ratings converge as evidence accumulates. Hot streaks reflect variance around a true skill level and regress as games multiply — the map (rating) tracks the territory (skill) with calibrated uncertainty rather than ever fully trusting a single result.
The gap matters because players, coaches, and platform designers make consequential decisions—training load, opponent selection, self-evaluation—based on a misread of what rating movement communicates. Treating convergence as plateau triggers unnecessary interventions and creates anxiety around normal system behavior. In non-game applications, the same gap causes algorithmic outputs to be mistaken for ground truths about people.
