A Constraint Programming Approach for n-Day Lookahead Playoff Clinching in the NHL
Abstract
In professional sports, a team has clinched the playoffs if they are guaranteed a postseason spot, regardless of the outcomes of any remaining games. As the season progresses, sports fans and other stakeholders are interested in precisely when, and under what conditions, their team will clinch the playoffs. In this paper, we investigate playoff clinching in the context of the National Hockey League (NHL), where it is computationally challenging to produce clinching scenarios due, in part, to complex tie-breakers. We present an algorithm that determines under which combinations of game outcomes in the next n days a team will clinch the playoffs (i.e., "n-day lookahead clinching"). Our approach is a custom tree search which employs various preprocessing techniques, pruning strategies, and node ordering heuristics to efficiently explore the space of possible outcomes. The tree search leverages a constraint programming (CP)-based subroutine for inference that determines if a team has clinched the playoffs for some snapshot in time of the regular season (i.e., "0-day lookahead clinching"). This CP subroutine aims to find a counter-example in which the team being evaluated is eliminated, taking into account qualification rules and the NHL's extensive list of tie-breakers. We validate the efficacy of our algorithm using hundreds of scenarios based on public NHL data for the seasons 2021-22 through 2024-25. The methods introduced can be readily extended to other metrics of interest, including mathematical proof of playoff elimination, clinching the President's Trophy, as well as clinching (or being eliminated from clinching) any other seed in the standings.
Versions
Related
- Distances on Finite Constraint Systems and LICQ Radii in Nonlinear Programming
- Stability-Aware Constraint Programming for Emergency Rescheduling of Airport Apron Ground-Support Operations
- Cost-Aware Stopping for Freeze-Thaw Bayesian Optimization: When Does One-Step Lookahead Suffice?
- Near-Optimal Reinforcement Learning with Multi-Step Transition Lookahead
- textsc{Athanor}: local search over abstract constraint specifications
BibTeX
@misc{rosenberg2026constraint,
title = {{A Constraint Programming Approach for n-Day Lookahead Playoff Clinching in the NHL}},
author = {Gili Rosenberg and Kyle E. C. Booth and J. Kyle Brubaker and Ruben S. Andrist},
howpublished = {arXiv},
year = {2026},
month = may,
doi = {10.48550/arxiv.2605.13142},
eprint = {2605.13142},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2605.13142},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - A Constraint Programming Approach for n-Day Lookahead Playoff Clinching in the NHL
AU - Gili Rosenberg
AU - Kyle E. C. Booth
AU - J. Kyle Brubaker
AU - Ruben S. Andrist
PY - 2026
DA - 2026/05/14
PB - arXiv
DO - 10.48550/arxiv.2605.13142
UR - https://arxiv.org/abs/2605.13142
AB - In professional sports, a team has clinched the playoffs if they are guaranteed a postseason spot, regardless of the outcomes of any remaining games. As the season progresses, sports fans and other stakeholders are interested in precisely when, and under what conditions, their team will clinch the playoffs. In this paper, we investigate playoff clinching in the context of the National Hockey League (NHL), where it is computationally challenging to produce clinching scenarios due, in part, to complex tie-breakers. We present an algorithm that determines under which combinations of game outcomes in the next n days a team will clinch the playoffs (i.e., "n-day lookahead clinching"). Our approach is a custom tree search which employs various preprocessing techniques, pruning strategies, and node ordering heuristics to efficiently explore the space of possible outcomes. The tree search leverages a constraint programming (CP)-based subroutine for inference that determines if a team has clinched the playoffs for some snapshot in time of the regular season (i.e., "0-day lookahead clinching"). This CP subroutine aims to find a counter-example in which the team being evaluated is eliminated, taking into account qualification rules and the NHL's extensive list of tie-breakers. We validate the efficacy of our algorithm using hundreds of scenarios based on public NHL data for the seasons 2021-22 through 2024-25. The methods introduced can be readily extended to other metrics of interest, including mathematical proof of playoff elimination, clinching the President's Trophy, as well as clinching (or being eliminated from clinching) any other seed in the standings.
ER -