Cutthroat, an all-small game on graphs.
McCurdy, Sarah K., Nowakowski, Richard J. (2005)
Integers
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Discrepancy games.”
Cutthroat, an all-small game on graphs.
Winning strong games through fast strategies for weak games.
Ferber, Asaf, Hefetz, Dan (2011)
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:
Sumbers -- sums of ups and downs.
Kao, Kuo-Yuan (2005)
Integers
Similarity:
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:
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:
On the complexity of -player Hackenbush.
Cincotti, Alessandro (2009)
Integers
Similarity:
Positions of value in generalized domineering and chess.
Drummond-Cole, Gabriel C. (2005)
Integers
Similarity:
Game saturation of intersecting families
Balázs Patkós, Máté Vizer (2014)
Open Mathematics
Similarity:
We consider the following combinatorial game: two players, Fast and Slow, claim k-element subsets of [n] = 1, 2, …, n alternately, one at each turn, so that both players are allowed to pick sets that intersect all previously claimed subsets. The game ends when there does not exist any unclaimed k-subset that meets all already claimed sets. The score of the game is the number of sets claimed by the two players, the aim of Fast is to keep the score as low as possible, while the aim of...
Asymptotically optimal pairing strategy for tic-tac-toe with numerous directions.
Mukkamala, Padmini, Pálvölgyi, Dömötör (2010)
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...