Computing a perfect strategy for nxn chess requires time exponential in n
type: Item
instance of: scholarly article
title: Computing a perfect strategy for nxn chess requires time exponential in n
zbMATH Open document ID: 0467.90100
DOI: 10.1016/0097-3165(81)90016-9
author: Aviezri S. Fraenkel
author: David Lichtenstein
published in: Journal of Combinatorial Theory. Series A
publication date: 1981-01-01T00:00:00Z
Mathematics Subject Classification ID: 91A99
Mathematics Subject Classification ID: 91A05
zbMATH DE Number: 3733708
zbMATH Keywords: computing a perfect strategy
zbMATH Keywords: chess
zbMATH Keywords: nxn board
zbMATH Keywords: complete in exponential time
zbMATH Keywords: particular game
Wikidata QID: Q29012899
MaRDI profile type: Publication
full work available at URL: 0097-3165(81)90016-9
OpenAlex ID: W2091133474
cites work: Q4198056
cites work: GO Is Polynomial-Space Hard
cites work: Gobang is PSPACE-complete
cites work: Hex ist Pspace-vollständig. (Hex is Pspace-complete)
cites work: Provably Difficult Combinatorial Games
DBLP publication ID: journals/jct/FraenkelL81
description: scientific article; zbMATH DE number 3733708