MathDB
winning strategy painting black 2016 cells on a white strip

Source: St. Petersburg 2016 9.5

May 1, 2019
combinatoricsColoringcombinatorial geometrygame strategywinning positionsgame

Problem Statement

Kostya and Sergey play a game on a white strip of length 2016 cells. Kostya (he plays first) in one move should paint black over two neighboring white cells. Sergey should paint either one white cell either three neighboring white cells. It is forbidden to make a move, after which a white cell is formed the doesn't having any white neighbors. Loses the one that can make no other move. However, if all cells are painted, then Kostya wins. Who will win if he plays the right game (has a winning strategy)?