FA-94687 / Exam timetabling constraints / Member archive

Conflict pairs counted in both orders and with themselves · case 02

The matrix contains reversed and self pairs.

Member previewVariant 2 · 3 implementations · 8 checks per implementation

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 fixture

This sample comes from the broken implementation of a controlled reproducer.

Boundary fixture	Actual	Expected	Outcome
regression: pair loop bounds 1	`[["A", "A", 1], ["A", "B", 1], ["B", "A", 1], ["B", "B", 1]]`	`[["A", "B", 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.