All the cells of a $10\times10$ board are colored white initially. Two players are playing a game with alternating moves. A move consists of coloring any un-colored cell black. A player is considered to loose, if after his move no white domino is left. Which of the players has a winning strategy? Proposed by A. Khrabrov
Problem
Source: St. Petersburg MO 2001, 9th grade, P1
Tags: combinatorics, Combinatorial games, game, Game Theory, board, domino, Coloring