One-pile misère Nim for three or more players.
Kelly, Annela R. (2006)
International Journal of Mathematics and Mathematical Sciences
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.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Changes of the outcome of combinatorial games with differing number of prohibited repetitions”
One-pile misère Nim for three or more players.
An example in pursuit theory
A. Zięba (1962)
Studia Mathematica
Similarity:
A mixed duel under arbitrary moving
S. Trybuła (1991)
Applicationes Mathematicae
Similarity:
Simplification of partizan games in misère play.
Mesdal, G.A., Ottaway, P. (2007)
Integers
Similarity:
A noisy duel under arbitrary moving. IV
Stanisław Trybuła (1991)
Applicationes Mathematicae
Similarity:
A noisy duel under arbitrary moving. VI
Stanisław Trybuła (1991)
Applicationes Mathematicae
Similarity:
Rationality of the information exchange in bimatrix games
Milan Mareš (1985)
Kybernetika
Similarity:
A noisy duel under arbitrary moving. V
Stanisław Trybuła (1991)
Applicationes Mathematicae
Similarity:
A silent versus partially noisy one-bullet duel under arbitrary motion
S Trybuła (1991)
Applicationes Mathematicae
Similarity:
A silent duel under arbitrary moving
Stanisław Trybuła (1991)
Applicationes Mathematicae
Similarity: