- Complex systems theory
- >
- Computational complexity theory
- >
- Computational problems
- >
- PSPACE-complete problems

- Mathematical concepts
- >
- Mathematical problems
- >
- Computational problems
- >
- PSPACE-complete problems

- Theory of computation
- >
- Computational complexity theory
- >
- Computational problems
- >
- PSPACE-complete problems

Sokoban

Sokoban (倉庫番, Sōko-ban, lit. 'warehouse keeper') is a puzzle video game subgenre in which the player pushes crates or boxes around in a warehouse, trying to get them to storage locations. The game was

Rush Hour (puzzle)

Rush Hour is a sliding block puzzle invented by Nob Yoshigahara in the 1970s. It was first sold in the United States in 1996. It is now being manufactured by ThinkFun (formerly Binary Arts). ThinkFun

Generalized geography

In computational complexity theory, generalized geography is a well-known PSPACE-complete problem.

List of PSPACE-complete problems

Here are some of the more commonly known problems that are PSPACE-complete when expressed as decision problems. This list is in no way comprehensive.

True quantified Boolean formula

In computational complexity theory, the language TQBF is a formal language consisting of the true quantified Boolean formulas. A (fully) quantified Boolean formula is a formula in quantified propositi

Emptiness problem

In theoretical computer science and formal language theory, a formal language is empty if its set of valid sentences is the empty set. The emptiness problem is the question of determining whether a la

Gomoku

Gomoku, also called Five in a Row, is an abstract strategy board game. It is traditionally played with Go pieces (black and white stones) on a Go board. It is played using a 15×15 board while in the p

Intersection non-emptiness problem

The intersection non-emptiness problem, also known as finite automaton intersection problem or the non-emptiness of intersection problem, is a PSPACE-complete decision problem from the field of automa

NFA minimization

In automata theory (a branch of theoretical computer science), NFA minimization is the task of transforming a given nondeterministic finite automaton (NFA) into an equivalent NFA that has a minimum nu

Reversi

Reversi is a strategy board game for two players, played on an 8×8 uncheckered board. It was invented in 1883. Othello, a variant with a fixed initial setup of the board, was patented in 1971.

Game of the Amazons

The Game of the Amazons (in Spanish, El Juego de las Amazonas; often called Amazons for short) is a two-player abstract strategy game invented in 1988 by Walter Zamkauskas of Argentina. The game is pl

Atomix (video game)

Atomix is a puzzle video game developed by Günter Krämer (as "Softtouch") and published by Thalion Software, released for the Commodore Amiga and other personal computers in late 1990. The object of t

Constraint logic problem

No description available.

Canadian traveller problem

In computer science and graph theory, the Canadian traveller problem (CTP) is a generalization of the shortest path problem to graphs that are partially observable. In other words, the graph is reveal

Computer Othello

Computer Othello refers to computer architecture encompassing computer hardware and computer software capable of playing the game of Othello. It is also known as Reversi for Microsoft Windows (1.0-XP,

Formula game

A formula game is an artificial game represented by a fully quantified Boolean formula. Players' turns alternate and the space of possible moves is denoted by bound variables. If a variable is univers

Nondeterministic constraint logic

In theoretical computer science, nondeterministic constraint logic is a combinatorial system in which an orientation is given to the edges of a weighted undirected graph, subject to certain constraint

Hex (board game)

Hex is a two player abstract strategy board game in which players attempt to connect opposite sides of a rhombus-shaped board made of hexagonal cells. Hex was invented by mathematician and poet Piet H

© 2023 Useful Links.