Abstract
Many sports fans invest a great deal of time into watching and analyzing the performance of their favourite team. However, the tools at their disposal are primarily heuristic or based on folk wisdom. This paper provides a concrete mechanism for calculating the minimum number of points needed to guarantee a playoff spot in the National Hockey League (NHL). Along with determining how many games need to be won to guarantee a playoff spot comes the notion of “must win” games. Our method can identify those games where, if a team loses, they no longer control their own playoff destiny. As a side effect of this, we can also identify when teams get lucky and still make the playoffs even though another team could have eliminated them.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Russell, T., van Beek, P.: Mathematically clinching a playoff spot in the NHL and the effect of scoring systems. In: Bergler, S. (ed.) Canadian AI. LNCS, vol. 5032, pp. 234–245. Springer, Heidelberg (2008)
Ribeiro, C.C., Urrutia, S.: An application of integer programming to playoff elimination in football championships. International Transactions in Operational Research 12, 375–386 (2005)
Adler, I., Erera, A.L., Hochbaum, D.S., Olinick, E.V.: Baseball, optimization and the world wide web. Interfaces 32, 12–22 (2002)
Robinson, L.W.: Baseball playoff eliminations: an application of linear programming. Operations Research Letters 10, 67–74 (1991)
Gusfield, D., Martel, C.E.: The structure and complexity of sports elimination numbers. Algorithmica 32, 73–86 (2002)
Wayne, K.D.: A new property and a faster algorithm for baseball elimination. SIAM Journal on Discrete Mathematics 14, 223–229 (2001)
Brown, J.R.: The sharing problem. Operations Research 27, 324–340 (1979)
Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms and Applications. Prentice-Hall, Englewood Cliffs (1993)
Schwartz, B.: Possible winners in partially completed tournaments. SIAM Review 8, 302–308 (1966)
Maher, M., Narodytska, N., Quimper, C.G., Walsh, T.: Flow-based propagators for the sequence and related global constraints. In: Proceedings of the 14th International Conference on Principles and Practice of Constraint Programming (2008)
Siek, J., Lee, L.Q., Lumsdaine, A.: Boost Graph Library: User Guide and Reference Manual. Addison-Wesley, Reading (2001)
ILOG S.A.: ILOG Solver 4.2 user’s manual (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Russell, T., van Beek, P. (2009). Determining the Number of Games Needed to Guarantee an NHL Playoff Spot. In: van Hoeve, WJ., Hooker, J.N. (eds) Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. CPAIOR 2009. Lecture Notes in Computer Science, vol 5547. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01929-6_18
Download citation
DOI: https://doi.org/10.1007/978-3-642-01929-6_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-01928-9
Online ISBN: 978-3-642-01929-6
eBook Packages: Computer ScienceComputer Science (R0)