First-player conjecture for rectangular grid instances of INFLUENCE

Let Gn,mG_{n,m} be the rectangular grid with nn rows and mm columns, with alternated black and white vertices and a black vertex in the top-left corner. Let Ls(Gn,m)Ls(G_{n,m}) and Rs(Gn,m)Rs(G_{n,m}) denote the left and right scores of the corresponding game. Rectangular-grid first-player conjecture. For n,m2n,m\geq 2,

Ls(Gn,m)>0>Rs(Gn,m).Ls(G_{n,m})>0>Rs(G_{n,m}).

In particular, the first player wins and there is no draw.

Despite the symmetry of rectangular grids, there is no BW-automorphism, and the computations reported in the source all give a first-player victory; the conjecture remains unproved in general.

Sources & referencesView supporting material

Primary source

Eric Duchêne, Nacim Oijid and Aline Parreau, “Bipartite instances of INFLUENCE”, arXiv:2206.06118 (2022).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.