On the complexity of chess
作者：
Highlights：
•
摘要
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.
论文关键词：
论文评审过程：Received 29 June 1979, Revised 12 December 1980, Available online 2 December 2003.
论文官网地址：https://doi.org/10.1016/0022-0000(83)90030-2
