Multinational War is Hard
Computational Complexity
2015-03-11 v3
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.
Cite
@article{arxiv.1503.00141,
title = {Multinational War is Hard},
author = {Jonathan Weed},
journal= {arXiv preprint arXiv:1503.00141},
year = {2015}
}
Comments
10 pages [fixed references]