In this paper, we analyze the mis\`ere versions of two impartial combinatorial games: k-Bounded Greedy Nim and Greedy Nim. We present a complete solution to both games by showing necessary and sufficient conditions for a position to be P-positions.
Related papers
Ranked by semantic similarity — how closely each paper's abstract matches this one (100% = near-identical topic).