FA-12797 / Tournament pairing rules / Member archive
Greedy pairing strands the final entrants · case 02
Greedy pairing strands the final entrants.
Case scope
Greedy pairing strands the final entrants.
Why this case matters
Makes the stated pairing or standings policy executable without assuming any real federation rulebook.
One recorded failure
Sample boundary fixtureThis sample comes from the broken implementation of a controlled reproducer.
| Boundary fixture | Actual | Expected | Outcome |
|---|---|---|---|
| greedy dead end | null | [[2, 4], [3, 5]] | 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 ↗