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:
Displaying similar documents to “Vertex deletion games with parity rules.”
Carrying umbrellas: An online relocation game on a graph.
Cutthroat, an all-small game on graphs.
McCurdy, Sarah K., Nowakowski, Richard J. (2005)
Integers
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...
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:
An introduction to clobber.
Albert, Michael H., Grossman, J.P., Nowakowski, Richard J., Wolfe, David (2005)
Integers
Similarity:
Winning strong games through fast strategies for weak games.
Ferber, Asaf, Hefetz, Dan (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Game list colouring of graphs.
Borowiecki, M., Sidorowicz, E., Tuza, Zs. (2007)
The Electronic Journal of Combinatorics [electronic only]
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.
Positions of value in generalized domineering and chess.
Drummond-Cole, Gabriel C. (2005)
Integers
Similarity:
Konane has infinite nim-dimension.
dos Santos, Carlos Pereira, Silva, Jorge Nuno (2008)
Integers
Similarity:
Geography played on an -cycle times a 4-cycle.
Hogan, M.S., Horrocks, D.G. (2003)
Integers
Similarity:
Carcassonne -- description of the game
Kárná, Lucie
Similarity:
This article formalizes some aspects of the board game Carcassonne. Combinatorical problems related to the number of tile types are mentioned. Then the paper describes a game map using graph theory.
On the complexity of -player Hackenbush.
Cincotti, Alessandro (2009)
Integers
Similarity: