What's the Best Seat in the Game Left, Center, Right?
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866913559905042432 |
|---|---|
| author | Richeson, Benjamin Richeson, David |
| author_facet | Richeson, Benjamin Richeson, David |
| contents | Left, Center, Right is a popular dice game. We analyze the game using Markov chain and Monte Carlo methods. We compute the expected game length for two to eight players and determine the probability of winning for each player in the game. We discuss the surprising conclusions of which players have the highest and lowest chance of winning, and we propose a small rule change that makes the game a little more fair. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2407_05069 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | What's the Best Seat in the Game Left, Center, Right? Richeson, Benjamin Richeson, David History and Overview Computer Science and Game Theory Probability 00A08, 60J10 Left, Center, Right is a popular dice game. We analyze the game using Markov chain and Monte Carlo methods. We compute the expected game length for two to eight players and determine the probability of winning for each player in the game. We discuss the surprising conclusions of which players have the highest and lowest chance of winning, and we propose a small rule change that makes the game a little more fair. |
| title | What's the Best Seat in the Game Left, Center, Right? |
| topic | History and Overview Computer Science and Game Theory Probability 00A08, 60J10 |
| url | https://arxiv.org/abs/2407.05069 |