If a figure can be tiled by N 2x3 rectangles it is trivial to place the same number of U pentominoes in that figure.
Find the smallest N such that at least N+1 U pentominos can be placed in a figure tiled by N 2x3 rectangles.
|
||
perplexus dot info |
|
|
|||||||||||||||||||||||||||||||||||||