On the complexity of chess
type: Item
instance of: scholarly article
title: On the complexity of chess
zbMATH Open document ID: 0518.90096
DOI: 10.1016/0022-0000(83)90030-2
author: James A. Storer
published in: Journal of Computer and System Sciences
publication date: 1983-01-01T00:00:00Z
Mathematics Subject Classification ID: 91A05
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 3821487
zbMATH Keywords: complexity of chess
zbMATH Keywords: generalized chess
zbMATH Keywords: P-space-completeness
MaRDI profile type: Publication
full work available at URL: 0022-0000(83)90030-2
OpenAlex ID: W2015319564
cites work: Q4773298
cites work: A Combinatorial Problem Which Is Complete in Polynomial Space
cites work: Computing a perfect strategy for nxn chess requires time exponential in n
cites work: Q4198056
cites work: Efficient Planarity Testing
cites work: Q4131648
cites work: Q4157951
description: scientific article; zbMATH DE number 3821487