Problem #PRU-100615

Problems Discrete Mathematics Algorithm Theory Game theory Winning and loosing positions

Problem

Alice and Bob play a game, Alice will go first. They have a strip divided into 2026 identical squares. In each move, they put a 2×1 domino block on the strip, covering two full squares. The person that is not able to make their move loses. Who has a winning strategy?