| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10225753 | Theoretical Computer Science | 2018 | 5 Pages |
Abstract
This paper introduces a new variant of the game Nim-Bounded Greedy Nim. This game is a combination of Bounded Nim and Greedy Nim. We present a complete solution to this game, which generalizes the solution of Greedy Nim.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Rongxing Xu, Xuding Zhu,