The game of n-player Cutcake

DOI10.1016/J.TCS.2011.06.036MaRDI QIDQ719309zbMATH OpenOpenAlexFDO

Authors Alessandro Cincotti

Publication date 10 October 2011

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

Full work available at URL https://doi.org/10.1016/j.tcs.2011.06.036

zbMATH Keywords

\(n\)-player gamecombinatorial gamecutcake

Mathematics Subject Classification ID

(n)-person games, (n>2) (91A06) Combinatorial games (91A46)

Recommendations

• The game of Cutblock
• Analyzing n-player Maundy Cake
• \(N\)-player partizan games
• On the Complexity of n-Player Hackenbush
• The arithmetic-periodicity of \textsc{cut} for \(\mathcal{C} = \{1, 2 c\}\)

Cites work

• \(N\)-player partizan games
• scientific article; zbMATH DE number 3761989 (Why is no real title available?)
• scientific article; zbMATH DE number 3521877 (Why is no real title available?)
• The game of Cutblock

Cited in

(6)

• On the cookie game
• Playing Bynum's game cautiously
• The game of Cutblock
• Analyzing n-player Maundy Cake
• Cookie Monster plays games
• Playing Bynum's game cautiously

This page was built for publication: The game of \(n\)-player Cutcake

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