An NP-hard generalization of Nim
Abstract
A new combinatorial game is given. It generalizes both Substraction and Nim. It is proved the computation of Nash equilibrium points in this new game is NP-hard.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.