There's not a way to do that sort of grouping for these tiles.
Compare pi. I can find the numbers representing my name in ascii an infinite number of times in the digits of pi, but if i find it once, there's no information in where to find it again, i can't just move forward n digits to find it, then another n digits to find it again, and ao on.
So, it has "islands" of repenting combinations of tiles, but these islands do not repeat / translate in a regular way.
However, they might match in small patches, just never across the entire infinite plane.
cuz it would be mind blowing if you made a copy and it wasn't a copy... pauli whackamole exclusion tiling
Still, can one prove this is aperiodic from geometry alone? It seems rather difficult to actually prove that fact. Feels intuitive that there must be a period somewhere, however large it may be, on the infinite 2D plane.
For example, consider rectangles with sides of 1 and 3 units: they can cover the plane periodically (e.g. in a simple rectangular grid), but also aperiodically, because you can form a square grid of square 3 by 3 units "metatiles", each encoding one bit of information in the vertical or horizontal orientation of the narrow rectangles; then it's easy to break symmetry by orienting metatiles so that for all integers m and n some metatile differs from the metatile m rows and n columns away, so the period cannot be m rows and n columns.
So, there are "patterns" (as a matter of fact, the elementary tile is repeated infinitely on the tiling) but you cannot fill the plane with mere translations of one.
See: https://personal.math.ubc.ca/~cass/courses/m308-02b/projects...