NHL Playoff Clinching Algorithm Using Constraint Programming
A new algorithm determines NHL playoff clinching scenarios within an n-day lookahead. The approach uses a custom tree search with preprocessing, pruning, and node ordering heuristics, leveraging constraint programming to handle complex tie-breakers. This addresses the computational challenge of producing clinching scenarios for fans and stakeholders as the season progresses.
Key facts
- The algorithm is designed for the National Hockey League (NHL).
- It determines clinching scenarios for the next n days.
- The method uses a custom tree search with preprocessing, pruning, and node ordering.
- Constraint programming is used as a subroutine.
- The work is published on arXiv with ID 2605.13142.
- The algorithm handles complex tie-breakers.
- Clinching means guaranteed postseason spot regardless of remaining games.
- The paper is authored by researchers (not specified).
Entities
Institutions
- National Hockey League
- arXiv