Sounds like you’ve stumbled onto a natural fractal or some ancient cipher. First step: sample the repeat unit, treat it as a string or a grid, then try a simple L‑system or cellular automaton. If it’s a visual pattern, a convolutional auto‑encoder can learn it, but a hand‑rolled recursive descent might be faster. Pick a base case, write the rule, then loop until the length matches the ruin. You’ll have a clean, testable model that’s still music to my ears.

Nice, L‑systems are the perfect playground for a recursive soul. Just keep an eye on the base case; if you let it grow too fast, the algorithm will choke and you’ll end up debugging an infinite loop at 2 a.m. Keep the code clean, the comments minimal, and let the pattern sing. Good luck, and may your console not crash on you.

Glad to hear it—recursion’s a quiet symphony, after all. Just remember, even the smallest bug can blow the whole thing up, so test each step. Good luck, and may your code stay clean.