The game of Cutblock.
Cincotti, Alessandro (2008)
Integers
Similarity:
Displaying similar documents to “Biased positional games and small hypergraphs with large covers.”
The game of Cutblock.
The tenacity of zero-one laws.
Spencer, Joel H., St.John, Katherine (2001)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On the complexity of -player Hackenbush.
Cincotti, Alessandro (2009)
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.
Discrepancy games.
Alon, Noga, Krivelevich, Michael, Spencer, Joel, Szabó, Tibor (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
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:
A pairing strategy for tic-tac-toe on the integer lattice with numerous directions.
Kruczek, Klay, Sundberg, Eric (2008)
The Electronic Journal of Combinatorics [electronic only]
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:
Winning strong games through fast strategies for weak games.
Ferber, Asaf, Hefetz, Dan (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The sequential join of combinatorial games.
Stewart, Fraser (2007)
Integers
Similarity:
One-pile misère Nim for three or more players.
Kelly, Annela R. (2006)
International Journal of Mathematics and Mathematical Sciences
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...
Simplification of partizan games in misère play.
Mesdal, G.A., Ottaway, P. (2007)
Integers
Similarity: