0010011001001100
1 1 2
1 4 5
1 6 7
1 8 9
1 11 12
1 13 14
1 15 16
3 1 6
3 7 13
4 3 10
7 1 16

def runs(s):
    runs = []
    for p in range(1, len(s) // 2 + 1):
        i = 0
        while i + p < len(s):
            if s[i] == s[i + p]:
                j = i
                while j + p < len(s) and s[j] == s[j + p]:
                    j += 1
                if p <= (j + p - i)//2 and (i, j+p) not in runs:
                    runs.append((i, j+p))
                    i = j - 1
            i += 1
    return runs

def runs(s):
    runs = []
    for p in range(1, len(s) // 2 + 1):
        i = 0
        while i + p < len(s):
            if s[i] == s[i + p]:
                j = i
                while j + p < len(s) and s[j] == s[j + p]:
                    j += 1
                if p <= (j + p - i)//2 and (i, j+p) not in runs and not (i > 0 and s[i-1] == s[i]):
                    runs.append((i, j+p))
                    i = j - 1
            i += 1
    return runs

   nc
3 : '(12*y^3)+(12*y^2)+1'
   has
#@[ ~: #@-.
   kc
3 : '(36*y^2)+(60*y)+25'
   (nc has kc)>:i.10000000
0

x = 16, y = 16, rule = B3/S23
oobobobbbooobboo$
bbbboboobobobboo$
booobbobboboooob$
bobobobooboboooo$
bbbbbbbboobbbbbb$
boobobbbboboooob$
bboboooobobobobb$
bobbbbbbbbbbbbob$
bobbobbbooobbooo$
oobobboboboooboo$
oboobbbboobbbbob$
oboboobobboboobb$
oboooboobooooobo$
bbbbbbbobboobobb$
obbooboooooobboo$
bbobbobboboobboo!