Combinatorial games played randomly: Chomp and nim
Fuente:
arXiv
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866910311202684928 |
|---|---|
| author | Devlin, Pat Trifonova, Paulina |
| author_facet | Devlin, Pat Trifonova, Paulina |
| contents | In this note, we investigate combinatorial games where both players move randomly (each turn, independently selecting a legal move uniformly at random). In this model, we provide closed-form expressions for the expected number of turns in a game of Chomp with any starting condition. We also derive and prove formulas for the win probabilities for any game of Chomp with at most two rows. Additionally, we completely analyze the game of nim under random play by finding the expected number of turns and win probabilities from any starting position. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2401_16670 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Combinatorial games played randomly: Chomp and nim Devlin, Pat Trifonova, Paulina Combinatorics 91A46, 60C05, 05C81, 91A05, 00A08 In this note, we investigate combinatorial games where both players move randomly (each turn, independently selecting a legal move uniformly at random). In this model, we provide closed-form expressions for the expected number of turns in a game of Chomp with any starting condition. We also derive and prove formulas for the win probabilities for any game of Chomp with at most two rows. Additionally, we completely analyze the game of nim under random play by finding the expected number of turns and win probabilities from any starting position. |
| title | Combinatorial games played randomly: Chomp and nim |
| topic | Combinatorics 91A46, 60C05, 05C81, 91A05, 00A08 |
| url | https://arxiv.org/abs/2401.16670 |