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.
All Related Versions

This publication has 1 reference indexed in Scilit: