FA-94690 / Exam timetabling constraints / Member archive
Conflict pairs counted in both orders and with themselves · case 05
The matrix contains reversed and self pairs.
Case contract
enrol rows [student, exam] (may repeat). For every unordered pair of distinct exams (a < b) count the students enrolled in both. Return [a, b, count] rows sorted, omitting zero counts.
Why this case matters
The conflict matrix is the input to every exam timetabling algorithm; count errors silently change weights.
One recorded failure
Sample boundary fixtureThis sample comes from the broken implementation of a controlled reproducer.
| Boundary fixture | Actual | Expected | Outcome |
|---|---|---|---|
| regression: pair loop bounds 1 | [["BIO130", "BIO130", 2], ["BIO130", "ECON150", 1], ["BIO130", "MATH101", 1], ["CHEM120", "CHEM120", 2], ["CHEM120", "ECON150", 1], ["CHEM120", "MATH101", 1], ["ECON150", "BIO130", 1], ["ECON150", "CHEM120", 1], ["ECON150", "ECON150", 2], ["MATH101", "BIO130", 1], ["MATH101", "CHEM120", 1], ["MATH101", "MATH101", 2]] | [["BIO130", "ECON150", 1], ["BIO130", "MATH101", 1], ["CHEM120", "ECON150", 1], ["CHEM120", "MATH101", 1]] | Failed |
MEMBER ARCHIVE
The complete case is available to members.
This record includes three runnable implementations, regression fixtures, execution results, and source hashes.
Member access is invitation-based. Sign in with your invited account to inspect the sources.
Sign in to the archive ↗