An NP-hard generalization of Nim
Author:
Preprint
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.Keywords
All Related Versions
This publication has 1 reference indexed in Scilit:
- Nim, A Game with a Complete Mathematical TheoryAnnals of Mathematics, 1901