A Constraint Programming Approach for n-Day Lookahead Playoff Clinching in the NHL
Gili Rosenberg, Kyle E. C. Booth, J. Kyle Brubaker, and Ruben S. Andrist

TL;DR
This paper introduces a constraint programming-based algorithm to determine when NHL teams will clinch playoff spots within a specified number of days, efficiently handling complex tie-breaker rules.
Contribution
It presents a novel tree search algorithm combined with constraint programming to accurately and efficiently identify playoff clinching scenarios in the NHL.
Findings
Validated with hundreds of scenarios from NHL data (2021-2024).
Efficiently explores outcome spaces using pruning and heuristics.
Can be extended to other playoff metrics and scenarios.
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 days a team will clinch the playoffs (i.e., "-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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
