Battle Sheep is PSPACE-complete
Kyle Burke, Hirotaka Ono
TL;DR
Battle Sheep, a two-player combinatorial board game, is proven to be PSPACE-complete, indicating high computational complexity even with limited stack sizes.
Contribution
This paper establishes the PSPACE-completeness of Battle Sheep, a popular game, even when stacks are restricted to three tokens.
Findings
Battle Sheep is PSPACE-complete.
Complexity persists with stacks of up to 3 tokens.
The game’s computational difficulty is high despite simple rules.
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsArtificial Intelligence in Games · Advanced Combinatorial Mathematics · Advanced Graph Theory Research