Parameterized chess

Authors:
Allan Scott;Ulrike Stege
Affiliations:
Department of Computer Science, University of Victoria;Department of Computer Science, University of Victoria
Venue:
IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
Year:
2008

Citing 2
Cited 1

Some combinatorial game problems require Ω(nk) time

Journal of the ACM (JACM)
Computing a Perfect Strategy for n*n Chess Requires Time Exponential in N

Proceedings of the 8th Colloquium on Automata, Languages and Programming

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

Theoretical Computer Science

Quantified Score

Hi-index	0.01

Visualization

Abstract

It has been suggested that the parameterized complexityclass AW[*] is the natural home of k-move games, but to date the numberof problems known to be in this class has remained small. We investigatethe complexity of Short Generalized Chess-the problem of decidingwhether a chess player can force checkmate in the next k moves. Weshow that this problem is complete for AW[*].