Work

Strong NP-Hardness of Winning from Reachable Positions in Marvel Champions: The Card Game

Year: 2026

Type: preprint

Abstract: In this paper, we study the computational complexity of deciding whether a cooperative team can win Marvel Champions: The Card Game from an explicitly supplied game position. We prove strong NP-hardness for positions in the official God of Lies scenario in Epic Multiplayer Mode. The reduction is from 3-Partition and uses only published cards and official rules. The result holds even for Standard-difficulty positions with one player per group, reachable from a legal initial setup by a polynomial-length sequence of actions.

Source: Zenodo (CERN European Organization for Nuclear Research)

DOI: 10.5281/zenodo.24052101

Author: Fernández-Combarro Álvarez, Elías

Language: English

Topic: Advanced Graph Theory Research

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W7225570512

Cites:

Cited by:

Related to: 10