In this puzzle you must tile the plane with identically sized colored L and J tetraminos. To start I will place two of them like so:
Your task will be to tile the entire rest of the plane meeting four conditions
My initial tiles will remain where they are.
No two tetraminos of the same color can share a side.
All tetraminos must be 1 of three colors (the two colors used already plus one extra)
With a finite number of exceptions, all tetraminos should be one of the two colors initially used. That is to say that you should be able to draw a box such that only these two colors of tetraminos appear outside of the box.
How can this be achieved?
If you want to try an easier version of this, try relaxing rule 3 to allow 4 colors. If you have solved this try minimizing the number of tiles of the third color.