Formal Specification
Set-ta-chas Disk-Casting Game — Formal Specification
Usa · dice-lots · Confidence: low
← Back to game pageImplementation Suitability
Suitability: adaptation-requiredFidelity: discretizedGap-fills: 6
# Snohomish Set-ta-chas Disk-Casting Game — AI-optimized specification
## General idea
A hidden-lot guessing game: each player's 20 disks (2 marked 'chiefs', 18 plain 'slaves') are split 5-and-5 under each hand and run out hand to hand while the opponent calls which hand the chief disk will end up in.
## Formal model
Player state: 20 disks with 2 designated 'chief' positions, split into two hidden groups of 5 (assigned to right/left hand — [gap-fill: assignment of 2 chiefs across 2 groups of 5 disks under dressed bark is unstated]). Opponent action: call(hand) before the run-out completes. Resolution: reveal which hand the chief disk(s) ended in; compare to the call.
## Formal rules
R1. Setup: active player secretly distributes 20 disks (2 chiefs, 18 slaves) into two groups of 5 under stlowi, one per hand.
R2. Run-out: disks are transferred/run from the right hand to the left [gap-fill: exact mechanical action and timing of 'running out' not fully specified].
R3. Call: before the run-out finishes, the opposing player calls left or right, naming the hand they believe holds the chief.
R4. Resolve: reveal the chief disk's actual hand; call correct = guesser wins, call incorrect = guesser loses.
R5. [gap-fill: how stakes accumulate over multiple rounds, stake escalation, and whether play passes to a new guesser or reverses roles are not stated].
## Edge cases
- Tie at the end: not applicable to single round (binary right/left call outcome); unaddressed for overall match as no multi-round match length or stake target is recorded.
- A player with no legal move: not applicable; guesser calls right or left before run-out completes.
- Repetition / cycles: unaddressed; rounds repeat with no documented session termination condition.
- Simultaneous claims on one position: [gap-fill: chief disk split across both hands — assume call must match at least one chief].
- Elimination mid-round and turn-order repair: not applicable; 2 primary gamblers with backers; no player elimination is recorded.
- Resource exhaustion: disk sets (20 disks per player) remain constant; stake transfer and stake pool exhaustion are unstated.
- Termination guarantee: single round terminates upon disk reveal; multi-round session termination is not guaranteed by the source without an external round cap or stake target.
## State representation
{active_disks: {right: [5 disks], left: [5 disks]}, call: enum(left,right), chiefs_positions}
## Action space
distribute(active_player); call(opponent, hand); reveal()
## Playability notes
The chief-disk-split edge case (2 chiefs, only 5 slots per hand) needs a house rule to be fully simulable; recommend constraining setup so both chiefs are always assigned to the same hand for a clean binary guess, flagged as a [gap-fill: handling chief-disk-split edge case] from the ambiguous source.
## Implementation hints
Implement as a binary hidden-hand guess (like a shell game) with configurable odds based on chief count per hand; flag the run-out mechanic and multi-round stake rules as [gap-fill: run-out mechanic and multi-round stake rules].
Download as JSON
Download the full game corpus entry for this game as structured JSON.
Download JSONCite this page
Set-ta-chas Disk-Casting Game (Usa). (n.d.). Games of Countries. https://gamesofcountries.com/games/us-usa/snohomish-disk-casting-game
@misc{gamesofcountries-us-usa-snohomish-disk-casting-game,
title = {Set-ta-chas Disk-Casting Game (Usa)},
year = {n.d.},
publisher = {Games of Countries},
url = {https://gamesofcountries.com/games/us-usa/snohomish-disk-casting-game}
}