English

An NP-hard generalization of Nim

Computer Science and Game Theory 2024-08-27 v1 Combinatorics

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

Cite

@article{arxiv.2408.13834,
  title  = {An NP-hard generalization of Nim},
  author = {Chunlei Liu},
  journal= {arXiv preprint arXiv:2408.13834},
  year   = {2024}
}