Strategies in a misère two-player tree searching game
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916647657275392 |
|---|---|
| author | Andrews, Ben |
| author_facet | Andrews, Ben |
| contents | In this paper, we analyse a misere tree searching game, where players take turns to guess vertices in a tree with a secret `poisoned' vertex. After each turn, the guessed vertex is removed from the tree and the game continues on the component containing the poisoned vertex, and as soon as a player guesses the poisoned vertex, they lose. We describe and prove the solution when the game is played on a path graph, both between two optimal players and between a player who makes their decisions uniformly at random and an opponent who plays to exploit this. We show that, with two perfect players, the solution involves different guessing strategies depending on the value of n modulo 4. We then show that, with a random and an exploitative player, the probability that the exploitative player wins approaches a constant (approximately 0.599) as n increases, and that the vertices one away from the leaves of the path are always optimal guesses for them. We also solve the game played on a star graph, and briefly discuss the possibility for extending the analysis to more general trees. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2411_10502 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Strategies in a misère two-player tree searching game Andrews, Ben Probability Combinatorics In this paper, we analyse a misere tree searching game, where players take turns to guess vertices in a tree with a secret `poisoned' vertex. After each turn, the guessed vertex is removed from the tree and the game continues on the component containing the poisoned vertex, and as soon as a player guesses the poisoned vertex, they lose. We describe and prove the solution when the game is played on a path graph, both between two optimal players and between a player who makes their decisions uniformly at random and an opponent who plays to exploit this. We show that, with two perfect players, the solution involves different guessing strategies depending on the value of n modulo 4. We then show that, with a random and an exploitative player, the probability that the exploitative player wins approaches a constant (approximately 0.599) as n increases, and that the vertices one away from the leaves of the path are always optimal guesses for them. We also solve the game played on a star graph, and briefly discuss the possibility for extending the analysis to more general trees. |
| title | Strategies in a misère two-player tree searching game |
| topic | Probability Combinatorics |
| url | https://arxiv.org/abs/2411.10502 |