1994
DOI: 10.1016/0304-3975(94)90131-7
|View full text |Cite
|
Sign up to set email alerts
|

The Othello game on an n × n board is PSPACE-complete

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
20
0

Year Published

2001
2001
2020
2020

Publication Types

Select...
6
3
1

Relationship

0
10

Authors

Journals

citations
Cited by 61 publications
(20 citation statements)
references
References 9 publications
0
20
0
Order By: Relevance
“…In complexity theory, as will be seen in the next section, we can study differences in complexity between general mathematical problems. So, for example, we can know that the general problem of finding the best strategy for the game reversi (Othello) is less complex than that of chess (Iwata and Kasai 1994;Fraenkel and Lichtenstein 1981).…”
Section: What Is Cognitive Complexity?mentioning
confidence: 99%
“…In complexity theory, as will be seen in the next section, we can study differences in complexity between general mathematical problems. So, for example, we can know that the general problem of finding the best strategy for the game reversi (Othello) is less complex than that of chess (Iwata and Kasai 1994;Fraenkel and Lichtenstein 1981).…”
Section: What Is Cognitive Complexity?mentioning
confidence: 99%
“…As for games on the (n × n)-extension of a square grid, Othello [7], Rush Hour [4], and Amazons [5] are known to be PSPACE-hard.…”
Section: Generalized Chat Noirmentioning
confidence: 99%
“…Generalized to an n × n board with an arbitrary initial configuration, the game is clearly in PSPACE because only n 2 − 4 moves can be made. Furthermore, Iwata and Kasai [IK94] proved that the game is PSPACEcomplete.…”
Section: Othello (Reversi)mentioning
confidence: 99%