Sequential compounds of combinatorial games

DOI10.1016/0304-3975(93)90162-MMaRDI QIDQ688160zbMATH OpenOpenAlexFDO

Authors Walter Stromquist, Daniel H. Ullman

Publication date 28 November 1993

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(93)90162-m

zbMATH Keywords

combinatorial gamesGrundy valuessequential compoundsmisère

Mathematics Subject Classification ID

2-person games (91A05) Combinatorial games (91A46)

Recommendations

• scientific article; zbMATH DE number 5133448
• Misère quotients for impartial games
• scientific article; zbMATH DE number 5171562
• Advances in losing
• scientific article; zbMATH DE number 863512

Cites work

• scientific article; zbMATH DE number 3124339 (Why is no real title available?)
• scientific article; zbMATH DE number 3761989 (Why is no real title available?)
• scientific article; zbMATH DE number 3521877 (Why is no real title available?)
• Daisies, Kayles, and the Sibert-Conway decomposition in misère octal games
• Mathematical Kayles
• On misere Nim-type games
• On sums of graph games with last player losing

Cited in

(8)

• Algebraic structure in a family of Nim-like arrays.
• scientific article; zbMATH DE number 7199604 (Why is no real title available?)
• The switch operators and push-the-button games: a sequential compound over rulesets
• A family of Nim-like arrays: the locator theorem
• Building Nim
• On solving games constructed using both short and long conjunctive sums
• scientific article; zbMATH DE number 5133448 (Why is no real title available?)
• Compound Node-Kayles on paths

This page was built for publication: Sequential compounds of combinatorial games

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