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.
翻译:提出了一种新的组合博弈。该博弈同时推广了减法游戏与Nim游戏。本文证明了在此新博弈中计算纳什均衡点是NP难问题。