Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2403.17302 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917003678187520 |
|---|---|
| author | De Carufel, Jean-Lou Jerade, Marie Rose |
| author_facet | De Carufel, Jean-Lou Jerade, Marie Rose |
| contents | So Long Sucker is a strategy board game that requires 4 players, each with $c$ chips of their designated color, and a board made of $k$ empty piles. With a clear set-up comes intricate rules, such as: players taking turns but not in a fixed order, agreements made between some players broken at any time, or a player winning the game without any chips in hand.
One of the main points of interest in studying this game is finding when a player has a winning strategy. The game begins with four players who get successively eliminated until only the winner is left. To study winning strategies, it is of interest to look at endgame situations. For that, we study the following game set-up: there are two players left in the game, Blue and Red, with only their respective chip colors. In this paper, we characterize Blue's winning scenarios and strategies for this game set-up through a delicate case analysis. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2403_17302 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | So Long Sucker: Endgame Analysis De Carufel, Jean-Lou Jerade, Marie Rose Combinatorics Computer Science and Game Theory So Long Sucker is a strategy board game that requires 4 players, each with $c$ chips of their designated color, and a board made of $k$ empty piles. With a clear set-up comes intricate rules, such as: players taking turns but not in a fixed order, agreements made between some players broken at any time, or a player winning the game without any chips in hand. One of the main points of interest in studying this game is finding when a player has a winning strategy. The game begins with four players who get successively eliminated until only the winner is left. To study winning strategies, it is of interest to look at endgame situations. For that, we study the following game set-up: there are two players left in the game, Blue and Red, with only their respective chip colors. In this paper, we characterize Blue's winning scenarios and strategies for this game set-up through a delicate case analysis. |
| title | So Long Sucker: Endgame Analysis |
| topic | Combinatorics Computer Science and Game Theory |
| url | https://arxiv.org/abs/2403.17302 |