论文信息 - On the Complexity of Chess

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.

James A. Storer | J. Storer

[1] David S. Johnson,et al. The complexity of checkers on an N × N board , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).

[2] Aviezri S. Fraenkel,et al. Computing a Perfect Strategy for n*n Chess Requires Time Exponential in N , 1981, ICALP.

[3] Robert E. Tarjan,et al. Efficient Planarity Testing , 1974, JACM.

[4] Aviezri S. Fraenkel,et al. Computing a Perfect Strategy for n x n Chess Requires Time Exponential in n , 1981, J. Comb. Theory, Ser. A.

[5] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .

[6] Thomas J. Schaefer,et al. Complexity of decision problems based on finite two-person perfect-information games , 1976, STOC '76.

[7] Robert E. Tarjan,et al. A Combinatorial Problem Which Is Complete in Polynomial Space , 1976, JACM.

[8] David Lichtenstein,et al. GO is pspace hard , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).