FA-83457 / Card game rule engines / Member archive

A set contract loses only the missing tricks · case 02

Going down by one on a bid of eight costs 10 instead of 80.

Member previewVariant 2 · 3 implementations · 8 checks per implementation

Case contract

Input [[bid1, bid2], [tricks1, tricks2], bags_before]. Nil (0) bids score +100 if the player took no tricks, else -100 and their tricks become bags. Other bids combine into a contract made by the non-nil players tricks: made -> 10*bid + 1 per overtrick (overtricks are bags); set -> -10*bid. Every 10 accumulated bags costs 100 and removes 10 bags. Return [score_delta, bags].

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
team score case 1	`[-230, 6]`	`[-240, 6]`	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.