Misère Greedy Nim and Misère Bounded Greedy Nim
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912414892556288 |
|---|---|
| author | Omiya, Nanako Yoshinaka, Ryo Shinohara, Ayumi |
| author_facet | Omiya, Nanako Yoshinaka, Ryo Shinohara, Ayumi |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2506_04657 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Misère Greedy Nim and Misère Bounded Greedy Nim Omiya, Nanako Yoshinaka, Ryo Shinohara, Ayumi Computer Science and Game Theory Discrete Mathematics 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. |
| title | Misère Greedy Nim and Misère Bounded Greedy Nim |
| topic | Computer Science and Game Theory Discrete Mathematics |
| url | https://arxiv.org/abs/2506.04657 |