Library

Misère Greedy Nim and Misère Bounded Greedy Nim

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.

Artificial Intelligence in GamesPolynomial and algebraic computationAdvanced Graph Theory Research
Source

Paper

Similar papers

Structural, Algorithmic, and Complexity-Theoretic Analyses of Misère Combinatorial GamesPrashanth Prabhala2025 In Library
The Sprague-Grundy Functions of Saturations of Misère NimYuki Irie2021 · The Electronic Journal of Combinatorics In Library
Misère GamesJörg Bewersdorff, David Kramer2021 In Library
Scoring NimHiromi Oginuma, Masato Shinoda2025 · Open MIND In Library
Scoring NimHiromi Oginuma, Masato Shinoda2025 · arXiv (Cornell University) In Library
Nim variantsMark van den Bergh, Walter A. Kosters, Flora Spieksma2022 · ICGA Journal In Library
A duality of misère games and play with a passKoki Suetsugu2026 · arXiv (Cornell University) In Library
Investigations of Impartial Games With a PassE. A. Hirsch2020 · arXiv (Cornell University) In Library
Recursive comparison tests for dicot and dead-ending games under misère playUrban Larsson, Rebecca Milley, Richard J. Nowakowski et al.2022 In Library
On Remoteness Functions of k-NIM with k + 1 Piles in Normal and in Misère VersionsVladimir Gurvich, Vladislav Maximchuk, Georgy Miheenkov et al.2024 · Games In Library
© 2026 NYSGPT2525 LLC