加载中…
2025-06-05
Misère Greedy Nim and Misère Bounded Greedy Nim
Nanako OmiyaRyo YoshinakaAyumi Shinohara
文献摘要
In this paper, we analyze the misère 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.
讨论
0讲解博客
生成讲解博客的中文版本
AI智能校验
生成AI智能校验的中文版本