An NP-hard generalization of Nim
<|reference_start|>An NP-hard generalization of Nim: 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.<|reference_end|>
@article{liu2024an,
    title={An NP-hard generalization of Nim},
    author={Chunlei Liu},
    journal={arXiv preprint arXiv:2408.13834},
    year={2024},
    archivePrefix={arXiv},
    eprint={2408.13834},
    primaryClass={cs.GT math.CO}
}