Deciding the winner in k rounds for DISJOINT ARROWS, a new combinatorial partizan game

DOI10.1016/J.TCS.2013.10.004MaRDI QIDQ391980zbMATH OpenOpenAlexFDO

Authors Angelo Monti

Publication date 13 January 2014

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

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

zbMATH Keywords

algorithmic combinatorial game theorycompleteness in polynomial spacehardness in fixed parameter computation

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) 2-person games (91A05) Games involving graphs (91A43)

Recommendations

• scientific article; zbMATH DE number 4181366
• Deciding the Winner of an Arbitrary Finite Poset Game Is PSPACE-Complete
• On the computational complexities of various geography variants
• Directed switching games. II: The arborescence game
• Games without repetitions on graphs with vertex disjoint cycles

Cites work

• Fixed-parameter tractability and completeness. IV: On completeness for W\([\) P\(]\) and PSPACE analogues
• Games, puzzles, and computation
• GO Is Polynomial-Space Hard
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1161563 (Why is no real title available?)
• On the complexity of some two-person perfect-information games
• Parameterized Chess
• Parameterized pursuit-evasion games
• Parametrized complexity theory.
• Undirected edge geography

Cited in

(1)

• On variants of vertex geography on undirected graphs

This page was built for publication: Deciding the winner in \(k\) rounds for DISJOINT ARROWS, a new combinatorial partizan game

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