Problem #PRU-100615

Problems Set theory and logic Theory of algotithms Game theory Winning and loosing positions

Problem

Alice and Bob play a game, Alice will go first. They have a strip divided into \(2018\) identical squares. In one move, they put a \(2 \times 1\) domino block on the strip, covering two full squares. One that is not able to make their move, loses. Who has the winning strategy?