Skip to main content
Formal Specification

Monshimout (Cheyenne Plum-Stone Dice Game) — Formal Specification

Usa · dice-lots · Confidence: low

← Back to game page

Implementation Suitability

Suitability: adaptation-requiredFidelity: discretizedGap-fills: 1
# Monshimout (Cheyenne Plum-Stone Dice Game) — AI-optimized specification ## General idea Two rows of paired opponents take turns tossing five marked plum stones in a basket; specific combinations of marks award 0, 1, 3, or 8 sticks from the opponent, a scoring throw earns another throw, and a player wins by taking all eight of her opponent's sticks. ## Formal model State: for each opposing pair, sticks_A and sticks_B (each starting at 8); current_thrower within the active pair; a shared turn-order pointer moving along one row then across to the other row. ## Formal rules R1. The active thrower tosses 5 stones (3 possible cross-faces, 2 possible bear-faces, rest blank), producing a combination. R2. Look up the combination against the fixed table: certain combinations score 0 (turn passes to the next player in the row); five-blanks, three-blanks-two-bears, or one-blank-two-bears-two-crosses score 1 (opponent gives 1 stick); two-blanks-three-crosses scores 3 (opponent gives 3 sticks); two-bears-three-crosses scores 8 (opponent gives all remaining sticks, ending the pair's game). R3. Any nonzero score grants the same thrower another throw (repeat from R1); a zero score passes the basket to the next player in the throwing row. R4. When the basket reaches the end of a row, it passes to the far end of the opposite row and proceeds back along it. R5. A pair's game ends when one player has taken all eight of her opponent's sticks. ## Edge cases Tie at end condition: not applicable — sticks are discrete and transferred whole; a pair's game always resolves to one player reaching zero sticks lost / opponent at eight. No legal move: not applicable — a throw is always available to the active thrower. Repetition/cycles: a long run of scoring throws by one player is the documented normal mode (R3), not a failure state — the game explicitly rewards this with continued turns. Simultaneous conflicting actions: not applicable — exactly one thrower acts at a time; other pairs' outcomes are determined by mirroring the same single physical basket's throw across the whole row, per R7 in the entry (all players in a row win/lose together with their row's active thrower). Mid-round elimination: a pair whose stick count reaches zero is finished (R5) while other pairs in the row continue only insofar as they mirror the same thrower's outcome — since Culin's account has one basket shared row-to-row rather than independent per-pair baskets, [gap-fill] assume finished pairs simply stop being affected once one side is at zero, per the entry's stated row-wide win/lose mirroring. Resource exhaustion: each player's 8-stick stake is the core depleting resource; the game is won precisely when one side's stake reaches zero. Termination guarantee: guaranteed — each throw either transfers 0 sticks (passing the turn onward, bounded by the finite row) or transfers a positive number toward the fixed 8-stick target, so the game cannot continue indefinitely. ## State representation (pairs: dict[pair_id -> {sticks_A: int, sticks_B: int}], row_order: list[player_id], basket_holder_index: int, active_row: A|B) ## Action space toss(thrower) — throw the five stones, resolving to one of the fixed scoring combinations via a random draw; pass_basket() — move the throwing turn to the next player per R3-R4. ## Playability notes The scoring table (R2) is precisely and completely attested by Grinnell's account — implement it verbatim rather than approximating, since it is one of the more fully specified dice-scoring systems in the whole Culin corpus. Dodge's larger-scale alternative scoring frame (target of ~2,000, individual throws up to 200) describes a structurally different game and should not be blended with Grinnell's eight-stick version; if both are implemented, keep them as separate selectable rulesets. ## Implementation hints A precise probability distribution over the five-stone combinations can be computed directly from the described stone marks (3 cross-faces, 2 bear-faces out of 5 stones, each independently landing marked-side-up or blank-side-up) if a fair-random implementation is wanted — the physical dice are the randomising mechanism, not the tossing technique, so a simple independent-Bernoulli-per-stone model is a reasonable, well-grounded choice here, unlike many Yulunga throw/catch games where no such physical model is given.

Download as JSON

Download the full game corpus entry for this game as structured JSON.

Download JSON
Cite this page

Monshimout (Cheyenne Plum-Stone Dice Game) (Usa). (n.d.). Games of Countries. https://gamesofcountries.com/games/us-usa/monshimout

@misc{gamesofcountries-us-usa-monshimout,
  title = {Monshimout (Cheyenne Plum-Stone Dice Game) (Usa)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/us-usa/monshimout}
}