The tag has no wiki summary.

learn more… | top users | synonyms

5
votes
0answers
41 views

Anything known about the Grundy Ordinal of Sylver's Coinage

Sylver's coinage is an example of an unbounded finite (if slightly modified) combinatorial impartial game. Quoth wikipedia: The two players take turns naming positive integers that are not the ...
10
votes
1answer
250 views

Nim and the Sierpinski Gasket

(I discovered this in high school, sent it off to a journal, never heard back, and forgot about it. I've never found anyone else who appeared to know about it; the combinatorial game theorists I've ...
0
votes
2answers
390 views

Generalized Sprague-Grundy Theorem

Hey, I know what is Sprague-Grundy theorem, but I want to know about generalized Sprague-Grundy (GSG) theorem ( which is used for games with cycles ). Apparently there seems to be very less ...
2
votes
7answers
1k views

Nim-like(?) game winning strategy?

I have the following Nim-like game (at least, it seems Nim-like to me). There are $2k$ tokens in a row, $k \in \mathbb{N}$. Each token $a_i$ has a value $ v_i \in \mathbb{N}$ All this information ...
2
votes
1answer
1k views

The game of “nimble” with no stacking

The game of Nimble is played as follows. You have a game board consisting of a line of squares labelled by the nonnegative integers. A finite number of coins are placed on the squares, with possibly ...