arXiv Open Access 2015

Multinational War is Hard

Jonathan Weed

Lihat Sumber

Abstrak

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.

Topik & Kata Kunci

cs.CC

Penulis (1)

Jonathan Weed

Format Sitasi

APA MLA BibTeX

Weed, J. (2015). Multinational War is Hard. https://arxiv.org/abs/1503.00141

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2015
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓