Generalized Harary Games
暂无分享,去创建一个
There are a number of positional games known on the infinite chessboard. One of the most studied is the 5-in-a-row, whose rules are almost identical to the ancient Japanese Go-Moku. Along this line Harary asked if a player can achieve a translated copy of a given polymino P when the two players alternately take the squares of the board. Here we pose his question for general subsets of the board, and give a condition under which a draw is possible. Since a drawing strategy corresponds to a good 2-coloration of the underlying hypergraph, our result can be viewed as a derandomization of the Lovász Local Lemma.
[1] Jorge Nuno Silva,et al. Mathematical Games , 1959, Nature.
[2] P. Erdos-L Lovász. Problems and Results on 3-chromatic Hypergraphs and Some Related Questions , 2022 .
[3] Paul Erdös,et al. On a Combinatorial Game , 1973, J. Comb. Theory A.
[4] József Beck,et al. An Algorithmic Approach to the Lovász Local Lemma. I , 1991, Random Struct. Algorithms.
[5] Noga Alon,et al. The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.