>>7291094 (pb)
How do you look for a fractal when all you got is a big grid with lots of patterns in them?
If the fractals won't lead to the gaps, then how do I use them?
I suppose there could be a unique penrose for every c or perhaps even every column. Once you combine two columns you have another fractal.
Is that more correct? There is no overarching fractal, it all depends on the c?
Let's assume we had a fractal, we knew about it and could render if (even if it's not possible). Then looking at the elements where d is between d[t], we're gazing at a spot in the fractal where there appears to be a gap. Where nothing exists, until we "zoom" in.
We zoom in by creating a new fractal based on those cells (D2+n) and (D) respectively (Which are also what we start by guessing with). What we should expect to see here are similar patterns, but they could be skewed, modified or somehow altered. We then need a way of comparing this with our initial fractal, to determine how to proceed.