Show that any (2i) × (3j) board, where i and j are positive integers, with no square missing, can be tiled with trominoes.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.