Daisies, Kayles, and the Sibert-Conway decomposition in misère octal games

DOI10.1016/0304-3975(92)90343-EzbMath0777.90095MaRDI QIDQ1184991

Thane E. Plambeck

Publication date: 28 June 1992

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

zbMATH Keywords

complete informationcombinatorial gamewinning strategyDaisiesfinite octal gamesimpartial two-player gameKayleswinning misère play

Mathematics Subject Classification ID

Combinatorial games (91A46)

Related Items (2)

Mathematical Kayles ⋮ Sequential compounds of combinatorial games

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on periodicity in some octal games
• Mathematical Kayles
• On sums of graph games with last player losing
• THE FITTING OF GROUPED TRUNCATED AND GROUPED CENSORED NORMAL DISTRIBUTIONS

This page was built for publication: Daisies, Kayles, and the Sibert-Conway decomposition in misère octal games