Skip to main content
Formal Specification

Five Stones — Formal Specification

Uzbekistan · dexterity-small · Confidence: medium

← Back to game page

Implementation Suitability

Suitability: adaptation-requiredFidelity: probabilistic-proxyGap-fills: 4
# Besh tosh — AI-optimized specification ## General idea Besh tosh is a sequential dexterity-and-catching game played with five smooth pebbles where players progress through six structured stages of increasing physical difficulty (picking single stones, pairs, triplets, quadruplets, flicking through finger-gates, and back-of-hand catching). Structurally distinct from knucklebones or dice games, success is determined by hand-eye timing, spatial judgment between scattered stones, and penalty-free stage transitions. ## Formal model - **Abstraction taken:** Fine motor coordination (tossing the launcher stone, scooping resting pebbles without nudging others, and catching the falling launcher) is abstracted into a stochastic success check P(success|stage_difficulty,scatter_distance,dexterity_skill). - **Player/agent count:** 2 to 4 agents (P1…PK, standard default K=2), operating in fixed sequential rotation. - **Turn model:** Sequential discrete turns. An active agent continues attempting stage steps until committing a fault (missed catch or illegal stone contact), at which point their turn ends and their progress stage is saved. ## Formal rules R1. **Setup & Game State:** - Target winning score: Starget=500 points [gap-fill: default target 500 points]. - Each player tracks: current score S(Pi)=0, stage pointer stage(Pi)∈{1…6}, and sub-step index step(Pi)∈{1…4}. - Stages: 1. **Birlar (Ones):** 4 sub-steps (toss launcher, scoop 1 stone, catch launcher). 2. **Ikkilar (Twos):** 2 sub-steps (toss launcher, scoop 2 stones, catch launcher). 3. **Uchlar (Threes):** 2 sub-steps (toss launcher, scoop 3 stones, then scoop 1 stone). 4. **To'rtlar (Fours):** 1 sub-step (toss launcher, scoop all 4 stones). 5. **Darvoza (Gate):** 4 sub-steps (toss launcher, flick 1 stone through gate arch, catch launcher). 6. **Xirmon (Harvest):** Toss all 5 stones from back of hand, catch in palm. R2. **Turn Execution:** - On an agent's turn, the agent rolls/scatters the 5 stones, establishing a spatial configuration C with pairwise distances dij. - The agent executes the required toss action for their current stage/step. - If the sampled outcome is `SUCCESS`: - If in stages 1–5: advance step(Pi) by 1. If all steps of the stage are completed, stage(Pi) advances to the next stage, resetting step=1. - If in stage 6 (Xirmon): sample ncaught∈{0…5} stones caught on hand. Award ncaught×100 points to S(Pi) [gap-fill: 100 points per caught stone]. Reset stage(Pi)=1,step(Pi)=1 to begin a new cycle. - The agent immediately retains the turn and executes the next sub-step. - If the sampled outcome is `FAULT`: - Current stage and sub-step are preserved. - Active turn passes immediately to (imodK)+1. R3. **Fault Conditions:** - A fault occurs on any toss where the stochastic sampler yields a drop, a collision with non-target stones, or a missed gate flick. R4. **Winning Condition:** - The first player to reach or exceed Starget points at the end of their turn wins immediately, and the match terminates. R5. [gap-fill] Anti-Stall Max Turn Rule:** - If no player reaches Starget after Tmax=50 total turn rotations, the game terminates and the player with the highest accumulated score wins. ## Edge cases - **Tie at the end condition:** If multiple players reach Starget in the same round cycle, the player with the higher total score wins. If tied, the player who completed more full 6-stage cycles wins [gap-fill]. - **A player with no legal move:** Not applicable; an active player must always execute the current stage toss action. - **Repetition / cycles:** Cycles are natural (stages loop 1 → 6 → 1) to accumulate points. Infinite looping without progress is bounded by R5 (Tmax=50 rounds). - **Simultaneous claims on the same resource or position:** Not applicable; turns and stone manipulation are strictly sequential. - **Player elimination mid-round:** Not applicable; no elimination occurs during standard play. If an agent disconnects/resigns, turn skips to (imodK)+1. - **Resource exhaustion:** Not applicable; the 5 stones are permanent and never consumed or removed. - **Termination guarantee:** The game provably terminates either when a player reaches Starget or upon reaching the Tmax turn limit. ## State representation - **Persistent state:** - Number of players K. - Target score Starget. - Per-player arrays: scores S(Pi), stage indices stage(Pi)∈{1…6}, step indices step(Pi)∈{1…4}, skill scalars dexterityi∈[0.0,1.0]. - Turn rotation index i∈{1…K}, total round count t. - **Per-turn ephemeral state:** - Scattered stone positions C={(xj,yj)}j=15. - Current toss success/fault flag. - **Observable information:** - Fully observable: all scores, stage progress, and stone scatter coordinates are public. ## Action space - `scatter_stones()`: Scatters pebbles at the start of a stage/cycle. - `execute_toss(target_stones)`: Performs the toss and scoop action for the current stage step. Parameters: set of target stone indices. Precondition: agent has the active turn. ## Playability notes - **Single-player-vs-AI:** Natural. A player can play solitaire (measuring turns to 500 points) or compete sequentially against an AI agent parameterized with realistic hand-eye error rates. - **Group games reduction:** Naturally scalable for 2 to 4 players with identical mechanics and turn passing. - **Physical-skill games:** Modeled as P(success)=base_rate(stage)×dexterityi×∏(1−proximity_penalty), where proximity penalty accounts for stones resting too close together. - **What is lost:** Tactile dexterity, physical catching reflexes, subtle fingertip arch construction, and the joy of physical pebble juggling. ## Implementation hints - Represent stage progression as a simple state machine: (1,1..4)→(2,1..2)→(3,1..2)→(4,1)→(5,1..4)→(6,1)→(1,1). - Hardcode stage baseline success rates (e.g. Stage 1: 0.90, Stage 4: 0.70, Stage 5: 0.60, Stage 6: 0.50) modulated by agent dexterity. - First milestone: Build the deterministic stage-advancement and fault-saving state machine with a mock 100% success rate, then wire in the stochastic toss resolver.

Download as JSON

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

Download JSON
Cite this page

Five Stones (Uzbekistan). (n.d.). Games of Countries. https://gamesofcountries.com/games/uz-uzbekistan/besh-tosh

@misc{gamesofcountries-uz-uzbekistan-besh-tosh,
  title = {Five Stones (Uzbekistan)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/uz-uzbekistan/besh-tosh}
}