FA-82052 / Poker hand evaluation / Member archive

Remainder computed over table size instead of winners · case 02

The number of odd units depends on how many seats are at the table.

Member previewVariant 2 · 3 implementations · 8 checks per implementation

Case contract

Input: {"pot", "winners", "seats" (clockwise), "button", "unit" (smallest chip in play; pot is a multiple of it)}. Split the pot equally in whole units; each leftover unit goes to one winner, starting with the first winner clockwise from the button (the button itself is last). Return {winner: amount} sorted by name.

Why this case matters

Odd-chip placement is where split pots disagree between dealers and software.

One recorded failure

Sample boundary fixture

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

Boundary fixture	Actual	Expected	Outcome
button is a winner	`{"a": 4, "d": 4}`	`{"a": 4, "d": 3}`	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.