DeepAI AI Chat
Log In Sign Up

A Combinatorial Game and an Efficiently Computable Shift Rule for the Prefer Max De Bruijn Sequence

by   Yotam Svoray, et al.
Ben-Gurion University of the Negev

We present a two-player combinatorial game over a k-ary shift-register and analyze it. The game is defined such that, for each of the player, the only way to avoid losing is to play such that the next state of the game is the next window in the well known prefer-max De Bruijn sequence. We then proceed to solve the game, i.e., to propose efficient algorithms that compute the moves for each player. Finally, we show how these algorithms can be combined into an efficiently computable shift-rule for the prefer-max sequence.


page 1

page 2

page 3

page 4


An Efficient Generalized Shift-Rule for the Prefer-Max De Bruijn Sequence

One of the fundamental ways to construct De Bruijn sequences is by using...

Move first, and become unbeatable: Strategy study of different Tic-tac-toe

The main challenge of combinatorial game theory is to handle combinatori...

A Polyhedral Approach to Some Max-min Problems

We consider a max-min variation of the classical problem of maximizing a...

Impartial games with entailing moves

Combinatorial Game Theory has also been called `additive game theory', w...

A Reverse Hex Solver

We present Solrex,an automated solver for the game of Reverse Hex.Revers...

Predicting Personas Using Mechanic Frequencies and Game State Traces

We investigate how to efficiently predict play personas based on playtra...

A Cycle Joining Construction of the Prefer-Max De Bruijn Sequence

We propose a novel construction for the well-known prefer-max De Bruijn ...