FA-82322 / Poker hand evaluation / Member archive

Higher badugi wins the pot · case 02

A-2-3-8 beats A-2-4-7 although the eight-high badugi is the worse hand.

Member previewVariant 2 · 3 implementations · 8 checks per implementation

Case contract

Input: [hand_a, hand_b], four distinct cards each. A hand's value is its best subset with all ranks distinct and all suits distinct: more cards beat fewer; among equal sizes the lower subset (compared from its highest card down, ace low = 1) wins. Return 1, -1 or 0.

Why this case matters

Badugi uses a unique subset-based evaluator that is easy to get subtly wrong.

One recorded failure

Sample boundary fixture

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

Boundary fixture	Actual	Expected	Outcome
lower badugi wins	`1`	`-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.