Deciding the winner in \(k\) rounds for DISJOINT ARROWS, a new combinatorial partizan game
From MaRDI portal
Publication:391980
DOI10.1016/j.tcs.2013.10.004zbMath1407.68197MaRDI QIDQ391980
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
algorithmic combinatorial game theory; completeness in polynomial space; hardness in fixed parameter computation
91A05: 2-person games
91A43: Games involving graphs
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Parameterized pursuit-evasion games
- Undirected edge geography
- On the complexity of some two-person perfect-information games
- Fixed-parameter tractability and completeness. IV: On completeness for W\([\) P\(\) and PSPACE analogues]
- Parametrized complexity theory.
- Parameterized Chess
- GO Is Polynomial-Space Hard