Battle Sheep is PSPACE-complete
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916729552109568 |
|---|---|
| author | Burke, Kyle Ono, Hirotaka |
| author_facet | Burke, Kyle Ono, Hirotaka |
| contents | Battle Sheep is a board game published by Blue Orange Games. With two players, it is a combinatorial game that uses normal play rules. We show that it is PSPACE-complete, even when each stack has only up to 3 tokens. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2505_06414 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Battle Sheep is PSPACE-complete Burke, Kyle Ono, Hirotaka Computational Complexity Combinatorics 91A46 F.1.3; F.2.2 Battle Sheep is a board game published by Blue Orange Games. With two players, it is a combinatorial game that uses normal play rules. We show that it is PSPACE-complete, even when each stack has only up to 3 tokens. |
| title | Battle Sheep is PSPACE-complete |
| topic | Computational Complexity Combinatorics 91A46 F.1.3; F.2.2 |
| url | https://arxiv.org/abs/2505.06414 |