TL;DR
This paper proves that determining winning strategies in a multiplayer variant of the children's game War is computationally very hard, specifically PSPACE-hard, and related survival questions are PSPACE-complete.
Contribution
It establishes the computational complexity of strategic decision problems in multiplayer War, showing they are PSPACE-hard and PSPACE-complete.
Findings
Winning strategy determination is PSPACE-hard.
Survival within k rounds is PSPACE-complete.
Complexity results apply to multiplayer War variants.
Abstract
In this paper, we show that the problem of determining whether one player can force a win in a multiplayer version of the children's card game War is PSPACE-hard. The same reduction shows that a related problem, asking whether a player can survive k rounds, is PSPACE-complete when k is polynomial in the size of the input.
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 · Game Theory and Applications · Advanced Malware Detection Techniques