FA-81962 / Poker hand evaluation / Member archive

Each rank prime divided out only once · case 02

Every paired hand is reported as high card.

Member previewVariant 2 · 3 implementations · 8 checks per implementation

Case contract

Input: five cards "Rs" (rank may be written "10" for ten; suits ignored, repeated ranks allowed up to four). Each rank maps to a distinct prime (2 for deuce ... 41 for ace); the product of the five primes is factored back into rank multiplicities, and the sorted multiplicity pattern names the rank shape: four of a kind, full house, three of a kind, two pair, one pair or high card.

Why this case matters

Prime-product hashing is how table-driven evaluators identify non-flush rank multisets.

One recorded failure

Sample boundary fixture

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

Boundary fixture	Actual	Expected	Outcome
pair of aces	`"error:KeyError"`	`"one pair"`	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.