On the Complexity of Chess

It is shown that for any reasonable generalization of chess to an NxN board, deciding for a given position which player has a winning strategy it is PSPACE-complete.