Parameterized Chess

DOI10.1007/978-3-540-79723-4_17zbMath1142.68362OpenAlexW2912875245MaRDI QIDQ3503588

Ulrike Stege, Allan Scott

Publication date: 5 June 2008

Published in: Parameterized and Exact Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-79723-4_17

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) 2-person games (91A05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (2)

On the complexity of connection games ⋮ Deciding the winner in \(k\) rounds for DISJOINT ARROWS, a new combinatorial partizan game

This page was built for publication: Parameterized Chess