Sequential compounds of combinatorial games

DOI10.1016/0304-3975(93)90162-MzbMath0781.90110OpenAlexW2028179941MaRDI QIDQ688160

Daniel H. Ullman, Walter R. Stromquist

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 gamesmisèreGrundy valuessequential compounds

Mathematics Subject Classification ID

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

Related Items (5)

A family of Nim-like arrays: the locator theorem ⋮ The switch operators and push-the-button games: a sequential compound over rulesets ⋮ Building Nim ⋮ Compound Node-Kayles on paths ⋮ Algebraic structure in a family of Nim-like arrays.

Cites Work

• On misere Nim-type games
• Daisies, Kayles, and the Sibert-Conway decomposition in misère octal games
• Mathematical Kayles
• On sums of graph games with last player losing
• Unnamed Item
• Unnamed Item
• Unnamed Item

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