Computing the empirical likelihood of scoring within the next N moves from each pitch location, separately for different game state subsets (e.g., set defense, counter-attack, regular play). Unlike Karun Singh's recursive expected threat model, the empirical approach is a direct frequentist calculation: for each location bin, count events in the subset that led to a goal within 5 moves, divide by total events in that bin. The key advantage: it can be computed for any arbitrary subset of events regardless of whether the eventual outcome falls within that subset. This reveals that the threat landscape is fundamentally different depending on game state — locations near the halfway line are far more threatening in counters than against set defenses, but this difference shrinks near the byline.
(1) Partition events by game state (using set-defense-proxy-detection or game-dynamics-classification). (2) For each subset, grid the attacking half of the pitch into location bins. (3) For each bin, compute P(goal within next 5 moves | event in this bin, this game state). (4) Compare threat surfaces across game states. Key patterns:
The threat landscape differs fundamentally by game state. Against set (organized) defenses, locations near the halfway line have almost zero threat (no space to attack into), but threat increases sharply near the byline because cutbacks penetrate organized blocks. Against counters, the pattern inverts: high threat near the halfway line (space to run into), declining toward the byline. Near the byline, the threat surfaces CONVERGE across game states — cutbacks are dangerous regardless of defensive organization.