The Othello game on an \(n\times n\) board is PSPACE-complete
type: Item
instance of: scholarly article
title: The Othello game on an \(n\times n\) board is PSPACE-complete
zbMATH Open document ID: 0801.68080
DOI: 10.1016/0304-3975(94)90131-7
author: Shigeki Iwata
author: Takumi Kasai
published in: Theoretical Computer Science
publication date: 1994-02-22T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 91A05
Mathematics Subject Classification ID: 91A43
zbMATH DE Number: 501195
zbMATH Keywords: Othello
zbMATH Keywords: PSPACE-complete
zbMATH Keywords: generalized geography
zbMATH Keywords: bipartite graphs
MaRDI profile type: Publication
full work available at URL: 0304-3975(94)90131-7
OpenAlex ID: W2088043394
Wikidata QID: Q29030258
cites work: Alternation
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: Planar Formulae and Their Uses
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: N by N Checkers is Exptime Complete
cites work: On the complexity of some two-person perfect-information games
description: scientific article; zbMATH DE number 501195