I already sought answers on three different forums without success. I hope I will be lucky this time.
I tried to find non-trivial solutions on a deficient 8×8 grid covered with trominoes and I regret to say that after extensive efforts I found only two non-trivial solutions:
diagram: 2 non-trivial solutions
The conditions of covering such a grid with trominoes are the following: In total we have 21 L-shaped trominoes with 3 different colors. There are equal numbers of trominoes of each color. Placing the trominoes on the grid, no 2 trominoes of the same color are allowed to touch each other anywhere, except only once, corner to corner (highlighted by red lines in the diagram).
Solutions from rotations and reflections are trivial. Does anyone know how to obtain more non-trivial solutions? Please include the full 8X8 grid in your answers.
It is more appropriate to be solved with a computer program. If you prefer to do it by hands, here is a workable procedure:
Place the hole. After removing symmetry redundancy, there are 10 distinct positions of the hole, namely: A1, B1, B2, C1, C2, C3, D1, D2, D3, D4;
Layout bricks, disregard color, you may want to work around the holes and spread out. Any partial layout that has additional holes in it is not feasible and should be discarded;
Color all feasible layouts obtained in step 2.
I was able to obtain a total of 49 unique solutions. Here is some examples: