Skip to main content
Formal Specification

Mauritanian five-stone dexterity game — Formal Specification

Mauritania · dexterity-small · Confidence: medium

← Back to game page

Implementation Suitability

Suitability: engine-readyFidelity: probabilistic-proxyGap-fills: 1
# Nqeycha — AI-optimized specification ## General idea A multi-level hand dexterity jacks/knucklebones challenge using 5 smooth desert stones. The active player tosses an airborne mother stone and must execute precise subsets of ground scoops (singles, pairs, triplets, quad, tunnel sweep, and back-of-hand flip catch) without dropping the falling stone or perturbing unselected stones. ## Formal model - **Abstraction taken:** Hand kinematics and multi-stone juggling physics are modeled as a 6-level state machine L∈[1,6] with stochastic execution success: P(pass)=f(level_difficulty,cluster_dispersion,dexterity_skill). - **Player/agent count:** 2 to 6 agents in fixed rotational order. - **Turn model:** Sequential turns. An agent continues attempting levels on success and yields the turn upon a fault. ## Formal rules R1. **Initial State & Levels:** - 5 physical stones: 1 airborne tosser (S0) and 4 ground stones (S1,S2,S3,S4). - Level progression: - Level 1: Scoop 4 singles (1+1+1+1). - Level 2: Scoop 2 pairs (2+2). - Level 3: Scoop triplet + single (3+1). - Level 4: Scoop all 4 together (4). - Level 5 (*Tunnel*): Push all 4 stones through a finger arch one by one. - Level 6 (*Dahr al-Kaff*): Toss all 5 stones, catch on back of hand, toss up and snatch in palm. R2. **Attempt Execution & Success Probabilities:** - On each level attempt, agent executes `toss_and_gather(level, subset_grouping)`: - Ground stones scattered randomly: (Xk,Yk)∼𝒰([−0.2,0.2]2m). - Ground dispersion D=maxj,k⁡‖(Xj,Yj)−(Xk,Yk)‖. - Probability of clean scoop and catch: P(success)=skill⋅e−λ⋅(level+D). R3. **Faults & State Persistence:** - If P(success) succeeds: Sub-step cleared. If all sub-steps of the level are cleared, `level \gets \text{level} + 1$, and player attempts next level. - If P(success) fails: Player suffers a **Fault** (`status = fault`). Turn immediately passes to the next player. Player's progress remains saved at `current_level`. R4. **Victory Condition:** - The first player to successfully complete Level 6 (*Dahr al-Kaff*) wins the match. ## Edge cases - **Tie at the end condition:** Not applicable — victory triggers dynamically on an individual player's turn. - **A player with no legal move:** Attempting the current level's gathering action is always legal. - **Repetition / cycles:** Bounded by strictly non-decreasing level state and positive success probability P>0. [gap-fill] If 40 aggregate rotation cycles pass without a winner, the player with the highest `level` progress wins. - **Simultaneous claims on the same resource or position:** Turns are strictly sequential; board is reset per player's turn. - **Player elimination mid-round; turn order repair:** If an agent drops out, rotation skips their turn index. - **Resource exhaustion:** Exactly 5 stones. - **Termination guarantee:** Guaranteed by non-decreasing level progression and the 40-cycle cap. ## State representation - **Persistent state:** Array of player levels `[L_1, ..., L_N]`, active player index ∈[0,N−1], total cycle count. - **Per-attempt state:** Coordinates of 4 ground stones (Xk,Yk), current sub-step index. - **Observable information:** Fully observable state. ## Action space - `toss_and_gather(level, subset_indices)`: - `subset_indices`: List of ground stone IDs to scoop during current airborne toss window. ## Playability notes - **Single-player-vs-AI:** Natural as a solitaire score-attack or competing against simulated AI players. - **Group games (N>2):** Standard round-robin rotation. - **Physical-skill games:** Finger dexterity and hand-eye coordination abstracted into parameterized failure rates. - **What is lost in the adaptation:** The physical sensation of balancing smooth polished quartz stones on the back of the knuckles. ## Implementation hints - Implement as a 6-state Markov decision process with distance-dependent transition probabilities. - First milestone: Implement levels 1–4 single-player state machine with deterministic inputs to verify level-advance triggers.

Download as JSON

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

Download JSON
Cite this page

Mauritanian five-stone dexterity game (Mauritania). (n.d.). Games of Countries. https://gamesofcountries.com/games/mr-mauritania/nqeycha

@misc{gamesofcountries-mr-mauritania-nqeycha,
  title = {Mauritanian five-stone dexterity game (Mauritania)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/mr-mauritania/nqeycha}
}