Tiling m by n rectangle game

180 Views Asked by At

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?

1

There are 1 best solutions below

0
On BEST ANSWER

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".

Basically, the general answer is not known, although we have a lot of results for particular small boards.