First is the worst, second is the best? A Markov chain analysis of the basketball game knockout
Fuente:
arXiv
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866910962966069248 |
|---|---|
| author | Flatz, Andrew Loper, Michael C. Weyer, Lezlie |
| author_facet | Flatz, Andrew Loper, Michael C. Weyer, Lezlie |
| contents | The game of Knockout is a classic playground game played with two basketballs. This paper uses a Markov process to analyze each player's probability of winning the game given their starting position in line and shooting percentages, assuming all players are equally skilled. The two-player case is solved in general for any probability of a long shot and short shot shooting percentage and the n-player case with n > 2 is solved numerically. In doing so, this paper answers the question of whether or not the playground wisdom of ``first is the worst, second is best'' is true. We also examine the average number of rounds it takes before the game ends, analyze trends in the data to recommend tips to win at Knockout, and provide questions in the case of players not being equally skilled. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2505_16842 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | First is the worst, second is the best? A Markov chain analysis of the basketball game knockout Flatz, Andrew Loper, Michael C. Weyer, Lezlie Optimization and Control 60J20 The game of Knockout is a classic playground game played with two basketballs. This paper uses a Markov process to analyze each player's probability of winning the game given their starting position in line and shooting percentages, assuming all players are equally skilled. The two-player case is solved in general for any probability of a long shot and short shot shooting percentage and the n-player case with n > 2 is solved numerically. In doing so, this paper answers the question of whether or not the playground wisdom of ``first is the worst, second is best'' is true. We also examine the average number of rounds it takes before the game ends, analyze trends in the data to recommend tips to win at Knockout, and provide questions in the case of players not being equally skilled. |
| title | First is the worst, second is the best? A Markov chain analysis of the basketball game knockout |
| topic | Optimization and Control 60J20 |
| url | https://arxiv.org/abs/2505.16842 |