Displaying similar documents to “Optimal Penney Ante strategy via correlation polynomial identities.”

The game of End-Nim.

Albert, Michael H., Nowakowski, Richard J. (2001)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

A morphic approach to combinatorial games: the Tribonacci case

Eric Duchêne, Michel Rigo (2007)

RAIRO - Theoretical Informatics and Applications

Similarity:

We propose a variation of Wythoff's game on three piles of tokens, in the sense that the losing positions can be derived from the Tribonacci word instead of the Fibonacci word for the two piles game. Thanks to the corresponding exotic numeration system built on the Tribonacci sequence, deciding whether a game position is losing or not can be computed in polynomial time.

Yet another hat game.

Paterson, Maura B., Stinson, Douglas R. (2010)

The Electronic Journal of Combinatorics [electronic only]

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...