Positions of value  in generalized domineering and chess.

Drummond-Cole, Gabriel C.

Displaying similar documents to “Positions of value $^{*} 2$ in generalized domineering and chess.”

Konane has infinite nim-dimension.

dos Santos, Carlos Pereira, Silva, Jorge Nuno (2008)

Integers

Similarity:

Geography played on an $n$ -cycle times a 4-cycle.

Hogan, M.S., Horrocks, D.G. (2003)

Integers

Similarity:

Two pile move-size dynamic Nim.

Holshouser, Arthur, Reiter, Harold (2005)

Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]

Similarity:

The shortest game of Chinese Checkers and related problems.

Bell, George I. (2009)

Integers

Similarity:

The first player wins the one-colour triangle avoidance game on 16 vertices

Przemysław Gordinowicz, Paweł Prałat (2012)

Discussiones Mathematicae Graph Theory

Similarity:

We consider the one-colour triangle avoidance game. Using a high performance computing network, we showed that the first player can win the game on 16 vertices.

Potential-based strategies for tic-tac-toe on the integer lattice with numerous directions.

Kruczek, Klay, Sundberg, Eric (2010)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Permissive strategies : from parity games to safety games

Julien Bernet, David Janin, Igor Walukiewicz (2002)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Similarity:

It is proposed to compare strategies in a parity game by comparing the sets of behaviours they allow. For such a game, there may be no winning strategy that encompasses all the behaviours of all winning strategies. It is shown, however, that there always exists a permissive strategy that encompasses all the behaviours of all memoryless strategies. An algorithm for finding such a permissive strategy is presented. Its complexity matches currently known upper bounds for the simpler problem...