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

05/07/2018

∙

by   Yotam Svoray, et al.

∙

Ben-Gurion University of the Negev

∙

0

∙

share

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.