AbstractGiven an arbitrary position of the Othello game played on an n × n board, the problem of determining the winner is shown to be PSPACE-complete. It can be reduced from generalized geography played on bipartite graphs with maximum degree 3
Abstract. We consider the complexity of infinite games played on finite graphs. We establish a frame...
Bloxorz is an online puzzle game where players move a 1×1×2 block by tilting it on a subset of the t...
Bloxorz is an online puzzle game where players move a 1 × 1 × 2 block by tilting it on a subset of t...
AbstractGiven an arbitrary position of the Othello game played on an n × n board, the problem of det...
AbstractThe game of edge geography is played by two players who alternately move a token on a graph ...
We prove that a variant of 2048, a popular online puzzle game, is PSPACE-Complete. Our hardness resu...
AbstractIt is shown that for any reasonable generalization of chess to an NxN board, deciding for a ...
ABSTRACT. It ~S shown that, given an arbitrary GO posmon on an n x n board, the problem of determini...
The game domination number is a graph invariant that arises from a game, which is related to graph d...
In a STOC 1976 paper, Schaefer proved that it is PSPACE-complete to determine the winner of the so-c...
is an important two-player impartial combinatorial game. The rule of the game is as follows: For a g...
We consider the sabotage game presented by van Benthem in an essay on the occasion of Jorg Siekmann...
We study the computational complexity of deciding the existence of a Pure Nash Equilibrium or a subg...
Abstract. In a Go endgame, each local area of play has a polynomial size canonical game tree and is ...
We consider the complexity of infinite games played on finite graphs. We estab-lish a framework in w...
Abstract. We consider the complexity of infinite games played on finite graphs. We establish a frame...
Bloxorz is an online puzzle game where players move a 1×1×2 block by tilting it on a subset of the t...
Bloxorz is an online puzzle game where players move a 1 × 1 × 2 block by tilting it on a subset of t...
AbstractGiven an arbitrary position of the Othello game played on an n × n board, the problem of det...
AbstractThe game of edge geography is played by two players who alternately move a token on a graph ...
We prove that a variant of 2048, a popular online puzzle game, is PSPACE-Complete. Our hardness resu...
AbstractIt is shown that for any reasonable generalization of chess to an NxN board, deciding for a ...
ABSTRACT. It ~S shown that, given an arbitrary GO posmon on an n x n board, the problem of determini...
The game domination number is a graph invariant that arises from a game, which is related to graph d...
In a STOC 1976 paper, Schaefer proved that it is PSPACE-complete to determine the winner of the so-c...
is an important two-player impartial combinatorial game. The rule of the game is as follows: For a g...
We consider the sabotage game presented by van Benthem in an essay on the occasion of Jorg Siekmann...
We study the computational complexity of deciding the existence of a Pure Nash Equilibrium or a subg...
Abstract. In a Go endgame, each local area of play has a polynomial size canonical game tree and is ...
We consider the complexity of infinite games played on finite graphs. We estab-lish a framework in w...
Abstract. We consider the complexity of infinite games played on finite graphs. We establish a frame...
Bloxorz is an online puzzle game where players move a 1×1×2 block by tilting it on a subset of the t...
Bloxorz is an online puzzle game where players move a 1 × 1 × 2 block by tilting it on a subset of t...
DOI
Add to ORKG