An introduction to clobber.
Albert, Michael H., Grossman, J.P., Nowakowski, Richard J., Wolfe, David (2005)
Integers
Similarity:
Displaying similar documents to “Cutthroat, an all-small game on graphs.”
An introduction to clobber.
Vertex deletion games with parity rules.
Nowakowski, Richard J., Ottaway, Paul (2005)
Integers
Similarity:
Carrying umbrellas: An online relocation game on a graph.
Lee, Jae-Ha, Park, Chong-Dae, Chwa, Kyung-Yong (2001)
Journal of Graph Algorithms and Applications
Similarity:
Winning strong games through fast strategies for weak games.
Ferber, Asaf, Hefetz, Dan (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Positions of value in generalized domineering and chess.
Drummond-Cole, Gabriel C. (2005)
Integers
Similarity:
Game list colouring of graphs.
Borowiecki, M., Sidorowicz, E., Tuza, Zs. (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Discrepancy games.
Alon, Noga, Krivelevich, Michael, Spencer, Joel, Szabó, Tibor (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Game chromatic number of Cartesian product graphs.
Bartnicki, T., Bresar, B., Grytczuk, J., Kovse, M., Miechowicz, Z., Peterin, I. (2008)
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...
Sumbers -- sums of ups and downs.
Kao, Kuo-Yuan (2005)
Integers
Similarity:
Geography played on an -cycle times a 4-cycle.
Hogan, M.S., Horrocks, D.G. (2003)
Integers
Similarity:
Konane has infinite nim-dimension.
dos Santos, Carlos Pereira, Silva, Jorge Nuno (2008)
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.