Maybe the "solution with the lowest Kolmogorov complexity".

In a sibling comment, I replied that usually a repeating pattern can also be applied, but that one usually requires storing the n-sequence, rarely making it the shortest encodable rule.