Information theory applied to championship competition
Shannon entropy, introduced by Claude Shannon in 1948, measures the uncertainty or disorder in a probability distribution. When applied to F1 championship points, it answers a simple question: how unpredictable is the championship?
We treat each driver's share of total points as a probability: pi = pointsi / total_points. Drivers with zero points are excluded (log(0) is undefined and they carry no information).
After Round 5
| Driver | Team | Points | pi | −pi log2(pi) | % of Total H |
|---|
Championship entropy across notable F1 seasons — normalized to [0, 1] competitiveness index
| Season | Description | H (bits) | Hmax | Competitiveness | Character |
|---|
How championship uncertainty has evolved through the first 5 races
| Round | Race | Leader | Scorers | H (bits) | H / Hmax | Trend |
|---|
A single number from 0% to 100% that captures how competitive a season is
Raw entropy H depends on the number of drivers — a 22-driver grid naturally has higher maximum entropy than a 20-driver grid. To compare across seasons with different grid sizes, we normalize: