All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars
 perplexus dot info

 Rectangles and U Pentominos (Posted on 2016-03-08)
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.

 See The Solution Submitted by Brian Smith No Rating

Comments: ( Back to comment list | You must be logged in to post comments.)
 re(2): posible solution 2 Comment 4 of 4 |
(In reply to re: posible solution 2 by Jer)

Congratulations!  That is the smallest I could find.  I expect this to be the smallest solution. It seems that all the U pentominos need to be joined into interlocking pairs in order to see any reduction in the space needed for the U pentominos.  In the big H solution, it takes four such pairs to create two sockets for the fifth pair to slide into, totaling 10 U pentominos.
 Posted by Brian Smith on 2016-03-10 00:07:34

 Search: Search body:
Forums (0)