On the Complexity of n-Player Hackenbush

DOI10.1515/INTEG.2009.049MaRDI QIDQ3400102zbMATH OpenFDO

Authors Alessandro Cincotti

Publication date 5 February 2010

Published in Integers (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/225020

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

\(n\)-player gamescomplexityHackenbush

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) (n)-person games, (n>2) (91A06) Combinatorial games (91A46)

Recommendations

• On Complexity of Ehrenfeucht-Fraïssé Games
• On complexity of Ehrenfeucht-Fraïssé games
• On the complexity of problems on simple games
• The Game of n-Player Shove and Its Complexity
• On the computational complexity of the domination game
• scientific article; zbMATH DE number 1342211
• On the complexity of heterogeneous multidimensional games
• The parameterized complexity of positional games
• On the complexity of succinct zero-sum games
• On the Descriptive Complexity of a Simplified Game of Hex

Cited in

(2)

• The Game of n-Player Shove and Its Complexity
• The game of \(n\)-player Cutcake

This page was built for publication: On the Complexity of n-Player Hackenbush

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