Abstract
It has been suggested that the parameterized complexity class AW[*] is the natural home of k-move games, but to date the number of problems known to be in this class has remained small. We investigate the complexity of Short Generalized Chess-the problem of deciding whether a chess player can force checkmate in the next k moves. We show that this problem is complete for AW[*]. © 2008 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Scott, A., & Stege, U. (2008). Parameterized chess. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5018 LNCS, pp. 172–189). https://doi.org/10.1007/978-3-540-79723-4_17
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
