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.)
 Possible solution. | Comment 1 of 4
A simple lower bound of Five 2x3 and Six U does not seem possible.  In fact, the best I can find uses Eleven 2x3 and Twelve U plus Six unused spaces:
`    AA    AABBBCCCDD  AABBBCCCDDEEEFFFGGGHHDDEEEFFFGGGHH IIIJJJKK  HH IIIJJJKK       KK    LL    LMMNNXXXOO  LLMNPPQQORRSSMMNNPQTTOORSUUVVPPQQT RRSSUVWW  TT XXXUUVVW       WW`

Is there a better one? This is a polyform problem variation I have not seen before.

 Posted by Jer on 2016-03-09 09:44:32

 Search: Search body:
Forums (0)