Misère annihilation games

DOI10.1016/0097-3165(84)90046-3zbMATH Open0546.90110OpenAlexW1981340727MaRDI QIDQ798574FDOQ798574

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

Recommendations

• Combinatorial analysis of a subtraction game on graphs
• On the complexity of the misère version of three games played on graphs
• On tame, pet, domestic, and miserable impartial games
• ON MISERE GAMES
• scientific article; zbMATH DE number 5171562

zbMATH Keywords

annihilation ruleprogressively finite graphsSprague-Grundy zeros and onesmisère annihilation games

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• On sums of graph games with last player losing
• Theory of annihilation games
• Slow joins of loopy games
• Strategy for a class of games with dynamic ties
• Three Annihilation Games
• Title not available (Why is that?)
• Loopy Games
• Title not available (Why is that?)

Cited In (8)

• The Max-Welter game
• Complexity, appeal and challenges of combinatorial games
• On the misere version of game Euclid and miserable games
• Recent results and questions in combinatorial game complexities
• The complexity of node blocking for dags
• Further generalizations of the Wythoff game and the minimum excludant
• Games, kernels, and antitone operations
• Misère Nim with multi-player

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q798574)