Mis\`ere Greedy Nim and Mis\`ere Bounded Greedy Nim
Computer Science and Game Theory
2025-06-06 v1 Discrete Mathematics
Abstract
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.
Cite
@article{arxiv.2506.04657,
title = {Mis\`ere Greedy Nim and Mis\`ere Bounded Greedy Nim},
author = {Nanako Omiya and Ryo Yoshinaka and Ayumi Shinohara},
journal= {arXiv preprint arXiv:2506.04657},
year = {2025}
}