Bayesian Imputation for Unplayed Games in Round-Robin Chess Tournaments: Application to Grand Chess Tour, Bucharest 2026
This paper proposes a Bayesian best linear unbiased prediction (BLUP) framework to impute scores for unplayed games in round-robin chess tournaments, demonstrating through simulations and a 2026 Bucharest case study that this method significantly reduces prediction error and ranking distortion compared to FIDE's current binary rules of annulment or forfeit.
Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer
Imagine a high-stakes chess tournament as a massive, round-robin dinner party. Every guest is supposed to sit down and play a game with every other guest. The person who wins the most games takes home the prize. But then, disaster strikes: one guest, let's call him "The Withdrawer," gets sick or has an emergency and has to leave the party halfway through.
Now, the host (the tournament organizer) faces a messy problem: What do you do about the games The Withdrawer never got to play?
The Old Way: The "All-or-Nothing" Rule
Currently, chess organizers use a very rigid, "all-or-nothing" rule based on a 50% threshold, like a traffic light that suddenly flips from red to green.
- Scenario A (The Withdrawer leaves early): If they played less than half their games, the host says, "Okay, pretend The Withdrawer never showed up." All their games are erased. If you beat them, that win disappears. If you lost to them, that loss vanishes. It's like the game never happened.
- Scenario B (The Withdrawer leaves late): If they played more than half their games, the host says, "Okay, they forfeited." Everyone who didn't get to play them gets a free win (1 point). Everyone who did play them keeps their actual result.
The Problem: This creates a weird "cliff." If a player leaves after 4 games, they get erased. If they leave after 5 games, everyone else gets a free win. This tiny difference in timing can completely change who wins the tournament, which feels unfair and arbitrary.
The New Idea: The "Smart Guess" (Bayesian Imputation)
The author, Ravi Varadhan, suggests a smarter way to handle this. Instead of erasing games or giving free wins, we should use a mathematical "smart guess" to estimate what would have happened if the games had actually been played.
Think of it like predicting the weather.
- The "Historical Forecast" (Elo Ratings): We know The Withdrawer is usually a very strong player (like a sunny day forecast based on last year's data).
- The "Current Conditions" (Tournament Performance): But in this specific tournament, The Withdrawer has been playing terribly, losing to everyone (like a sudden storm that just rolled in).
The new method combines these two pieces of information. It asks: "Based on who The Withdrawer usually is, AND how they are playing right now, what is the most likely score for the games they missed?"
How It Works (The "Blended Smoothie")
The paper proposes a formula that acts like a blender:
- The Base: It starts with the expected score based on the players' ratings (the "Historical Forecast").
- The Adjustment: It looks at how The Withdrawer actually performed in the games they did play. If they were playing poorly, the formula lowers the expected score for the missed games. If they were playing amazingly, it raises it.
- The Weight: The formula decides how much weight to give the "History" vs. the "Current Performance."
- If The Withdrawer only played 1 game before leaving, the formula trusts the "History" more (because 1 game is a fluke).
- If they played 8 games, the formula trusts the "Current Performance" more (because 8 games tell a real story).
The Bucharest 2026 Example
The paper tests this on a real (hypothetical) event in Bucharest where a star player, Alireza Firouzja, had to leave after 5 games.
- The Reality: Firouzja was playing very poorly (scoring only 1 point out of 5).
- The Old Rule (Forfeit): Since he played more than half, the four players who hadn't faced him yet would get a full point (1.0) each. This feels like a windfall, even though Firouzja was playing badly.
- The New Rule (Bayesian): The formula calculates that, given his terrible form, he probably would have lost or drawn most of those missed games. Instead of giving the opponents a full point, it awards them 0.55 to 0.70 points.
Why this matters: In the old rule, the players who actually beat Firouzja (earning 1.0 point) get no special advantage over the players who never faced him (who also get 1.0 point). The new rule preserves the advantage for the players who actually fought and won.
The "Simulation" Proof
To prove this works, the author ran a massive computer simulation—like a video game—creating 180,000 fake tournaments. They tested every possible scenario:
- Players leaving early vs. late.
- Players playing well vs. playing poorly.
- Different types of opponents.
The Result: The "Smart Guess" method was consistently more accurate than the old "All-or-Nothing" rules. It reduced errors by about 26% overall. It was especially good at handling the most common situation: when a player leaves because they are playing poorly (due to illness or bad form).
The Bottom Line
The paper argues that chess tournaments should stop using the rigid "50% rule" and start using this mathematical "Smart Guess" system.
- If the organizers want the best solution: Use the Bayesian formula (which is free and available as a computer app).
- If the organizers want a simpler backup: At the very least, they should stop using the "Forfeit" rule and just use "Annulment" (erasing the games) for everyone, because even that is statistically better than giving free wins.
The goal is simple: Fairness. The winner of a chess tournament should be the person who played the best, not the person who got lucky with the timing of a withdrawal.
Drowning in papers in your field?
Get daily digests of the most novel papers matching your research keywords — with technical summaries, in your language.