Originally posted by iamatigerI've tried, but it looks impossible to me. Are you supposed to fill the target region completely?
I came across this site
I see number 5351 has never been solved and has been on there since May
First one to solve it wins!
Originally posted by TheMaster37I think if you can fit them all in you will win, whether or not they fit the area.
Yes, I was that far. I didn't see a rule about filling the entire field.
Originally posted by iamatigerHaving done some of the others on this site now (but not this one yet), I think you have to fill the space. You don't have to use all the shapes, but in a well-designed puzzle it'll be necessary.
I think if you can fit them all in you will win, whether or not they fit the area.
Originally posted by AThousandYoungThe all fit in a 5x5 area, and if they are all to be used there has to be some significant overlapping.
When I realized the pieces were connected to other pieces AND that they could overlap I gave up.
However now I'm having some new thoughts...
Are all the groups of pieces the same size? All fit in a 4x4 area for example? Hmm.
Originally posted by iamatigerBrute force . I read your previous note and thought writing a program to do it would be interesting.
Wow, nice one! How did you do it?
Originally posted by mtthwWell, nice programming!
Brute force . I read your previous note and thought writing a program to do it would be interesting.
(I had tried several times to solve it without help, but never got very far).
Incidentally, my program did first find a solution that fits all the shapes in and does not fill the shape. That wasn't accepted, so it's definitely filling the shape that is required to solve the problem.
Originally posted by mtthwSo do we have any results of your work yet? If so, can that program be modified for a general overlapping piece puzzle solution? Good job BTW.
Yeah, I tried to avoid being too clever with mine - thought I'd worry about optimising if I found it was taking too long to solve it.
The heart of the program is a function that takes a list of shapes to put into the grid. It takes the first shape, tries all possible positions for that shape, and for those positions that fit it calls the same function recu ...[text shortened]... layout.removeShape(subShape);