Misère annihilation games

DOI10.1016/0097-3165(84)90046-3zbMath0546.90110OpenAlexW1981340727MaRDI QIDQ798574

Thomas S. Ferguson

Publication date: 1984

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(84)90046-3

zbMATH Keywords

annihilation rulemisère annihilation gamesprogressively finite graphsSprague-Grundy zeros and ones

Mathematics Subject Classification ID

Positional games (pursuit and evasion, etc.) (91A24)

Related Items (6)

Complexity, appeal and challenges of combinatorial games ⋮ On the misere version of game Euclid and miserable games ⋮ The Max-Welter game ⋮ The complexity of node blocking for dags ⋮ Further generalizations of the Wythoff game and the minimum excludant ⋮ Recent results and questions in combinatorial game complexities

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Slow joins of loopy games
• On sums of graph games with last player losing
• Strategy for a class of games with dynamic ties
• Three Annihilation Games
• Theory of annihilation games
• Loopy Games

This page was built for publication: Misère annihilation games