FA-83753 / Card game rule engines / Member archive

Pairs are compared by their lowest suit · case 03

5D-5S cannot beat 5C-5H.

Member previewVariant 3 · 3 implementations · 8 checks per implementation

Case contract

Input [current_combination, play]. Ranks 3 low to 2 high; suits D<C<H<S. A play is 1-3 cards of one rank. On an empty table any valid play is "ok"; otherwise it must have the same size and its highest card must outrank the current highest card (rank, then suit). Empty play is "pass". Return "ok", "invalid" or "pass".

Why this case matters

Card-game engines, scoring apps and online tables apply this rule automatically on every hand.

One recorded failure

Sample boundary fixture

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

Boundary fixture	Actual	Expected	Outcome
play case 7	`"ok"`	`"invalid"`	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.