Netrunner Mate-in-1 or -2 is Weakly NP-Hard
Jeffrey Bosboom (MIT CSAIL), Michael Hoffmann (ETH Zurich)
TL;DR
This paper proves that determining winning moves in a generalized version of the Netrunner game is computationally difficult, specifically weakly NP-hard for both the Runner and the Corp within limited turns.
Contribution
It establishes the computational complexity of mate-in-1 and mate-in-2 problems in a generalized Netrunner game, showing they are weakly NP-hard.
Findings
Deciding Runner's mate-in-1 is weakly NP-hard.
Deciding Corp's mate-in-2 is weakly NP-hard.
Complexity results hold for generalized decks with unlimited copies of cards.
Abstract
We prove that deciding whether the Runner can win this turn (mate-in-1) in the Netrunner card game generalized to allow decks to contain an arbitrary number of copies of a card is weakly NP-hard. We also prove that deciding whether the Corp can win within two turns (mate-in-2) in this generalized Netrunner is weakly NP-hard.
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
TopicsConstraint Satisfaction and Optimization · Optimization and Packing Problems · graph theory and CDMA systems