FA-81953 / Poker hand evaluation / Member archive

Paired ranks carry into the next bit · case 03

A pair inside a straight corrupts the mask and hides or invents straights.

Member previewVariant 3 · 3 implementations · 8 checks per implementation

Case contract

Input: 5 to 7 distinct cards "Rs". Build a rank bitmask (bit r for rank value r, 2..14; the ace also sets bit 1). Return the top rank of the highest five-card straight contained in the ranks (5 for the wheel), or 0 if none.

Why this case matters

Bitmask evaluators are the standard fast path for seven-card hold'em straights.

One recorded failure

Sample boundary fixture

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

Boundary fixture	Actual	Expected	Outcome
paired straight	`0`	`9`	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.