Question 46
Two players play a game with pennies, which are circles of radius $1$, on an $m \times n$ rectangular table. Each player takes turns putting a penny on the table so that it touches no other penny. The first player who is unable to do so loses. The table starts with no pennies on it. Assuming that there is an infinite supply of pennies, for what values of $m$ and $n$ does the first player have a winning strategy?