Two pile move-size dynamic Nim.
Holshouser, Arthur, Reiter, Harold (2005)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Reduced canonical forms of stoppers.”
Two pile move-size dynamic Nim.
A note on “Big-Match”
Jean-Michel Coulomb (1997)
ESAIM: Probability and Statistics
Similarity:
Simplification of partizan games in misère play.
Mesdal, G.A., Ottaway, P. (2007)
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:
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:
Dynamic one-pile blocking Nim.
Flammenkamp, Achim, Holshouser, Arthur, Reiter, Harold (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Blocking Wythoff Nim.
Larsson, Urban (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Geography played on an -cycle times a 4-cycle.
Hogan, M.S., Horrocks, D.G. (2003)
Integers
Similarity:
The game of End-Nim.
Albert, Michael H., Nowakowski, Richard J. (2001)
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:
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...
2-pile Nim with a restricted number of move-size imitations.
Larsson, Urban (2009)
Integers
Similarity: