constraint-graph-coloring
Vertices (pods, children, slots) are assigned distinct labels from a small finite set so that every connected/related pair satisfies a pairwise constraint — labels differ by at least k, labels match on at least one attribute, or labels are forbidden to clash. Key move: rank vertices by degree (or by number of incident constraints) and force the most constrained vertices first; high-degree vertices are pinned to extreme labels because their neighbors must fit in a shrunken pool. Then propagate by elimination and check the residual assignment against the remaining constraints.
How to solve
- Replace diff ≥ 2 with diff ≥ 3 on the same pod graph — fewer valid assignments, hubs get more extreme
- Swap the trait table: change which attributes overlap to flip which pair is forced as siblings
- Add or remove one edge to make the same target vertex either over- or under-constrained
Sub-archetype mix (2)
Click a row to see member problems.
- degree-driven-extreme-pinning 50% (1)
Each vertex has a numeric label from a contiguous range and connected labels must differ by at least k. The highest-degree vertices are forced to the extreme labels (min and max of the range) because their forbidden neighborhood (label ± k) is too large to absorb their neighbors. Then propagate by elimination.
More data (year-over-year, tool fingerprint, grade distribution, all members)
Tool fingerprint (1–17)
Grade distribution
- Gr 1 1
- Gr 6 1