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[*].
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abrahamson, K., Downey, R., Fellows, M.: Fixed-parameter tractability and completeness IV: On completeness for W[P] and PSPACE analogues. A. of Pure and Applied Logic 73, 235–276 (1995)
Adachi, A., Iwata, S., Kasai, T.: Some combinatorial game problems require ω(n k) time. J. ACM 31(2), 361–376 (1984)
Downey, R., Fellows, M.: Parameterized Complexity. Springer, Heidelberg (1999)
Fraenkel, A., Lichtenstein, D.: Computing a perfect strategy for n×n chess requires time exponential in n. LNCS 115, 278–293 (1981)
Kasai, T., Adachi, A., Iwata, S.: Classes of pebble games and complete problems. SIAM J. Comput. 8(4), 574–586 (1979)
Scott, A.: Short pursuit-evasion. Texts in Algorithmics 7: Algorithms and Complexity in Durham 2006, 141–152 (2006)
FIDE Handbook (Online Version): Chess rules, http://www.fide.com/official/handbook.asp?level=EE101
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Scott, A., Stege, U. (2008). Parameterized Chess. In: Grohe, M., Niedermeier, R. (eds) Parameterized and Exact Computation. IWPEC 2008. Lecture Notes in Computer Science, vol 5018. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-79723-4_17
Download citation
DOI: https://doi.org/10.1007/978-3-540-79723-4_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-79722-7
Online ISBN: 978-3-540-79723-4
eBook Packages: Computer ScienceComputer Science (R0)