On the complexity and topology of scoring games: of pirates and treasure

MaRDI QIDQ5384136zbMATH OpenFDO

Authors Péter Árendás, Zoltán Blázsik, Bertalan Bodor, Csaba Szabó

Publication date 21 June 2019

Full work available at URL http://math.colgate.edu/~integers/rg3/rg3.pdf

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

combinatorial gamegame complexitygames on graphstopology of games

Mathematics Subject Classification ID

Games on graphs (graph-theoretic aspects) (05C57) Analysis of algorithms and problem complexity (68Q25) Games involving graphs (91A43) Games involving topology, set theory, or logic (91A44) Combinatorial games (91A46)

Recommendations

• Pirates and treasure
• Graph sharing games: complexity and connectivity
• Graph sharing games: complexity and connectivity
• On the computational complexities of various geography variants
• PSPACE-Hardness of some combinatorial games

Cites work

• A metric for positional games
• A midsummer knot's dream
• Binary dicots, a core of dicot games
• scientific article; zbMATH DE number 2004829 (Why is no real title available?)
• scientific article; zbMATH DE number 3078996 (Why is no real title available?)
• Mean play of sums of positional games
• Pirates and treasure
• Reducibility among combinatorial problems
• Scoring play combinatorial games
• The combinatorial game theory of well-tempered scoring games

Cited in

(1)

• Pirates and treasure

This page was built for publication: On the complexity and topology of scoring games: of pirates and treasure

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