Consider an $m$ by $n$ rectangle. On this rectangle, two players take turns placing either $1$ by $2$ tiles or $3$ by $4$ tiles. The player who is able to place the last tile wins. Which player has a winning strategy and when?
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.
Here's how it works:
- Anybody can ask a question
- Anybody can answer
- The best answers are voted up and rise to the top
To expand on Henry's comment, the game has a name and has been studied a bit, even without the option of placing $3\times4$ tiles. If you can only place dominoes, the game is called "[normal play] Cram".