Skip to main content
Formal Specification

Sahrawi hidden ring deduction game (El Juego del Anillo) — Formal Specification

Western Sahara · guessing-hidden · Confidence: low

← Back to game page

Implementation Suitability

Suitability: engine-readyFidelity: directGap-fills: 1
# Labet El-Khatem — AI-optimized specification ## General idea A repeated zero-sum game of imperfect information, bluffing, and sequential revelation. In each round, the Hiding agent places a token (ring) into one of three cups/mounds. The Detecting agent can either make an immediate high-risk direct guess (+3 points on hit, 0 on miss) or perform sequential elimination of empty mounds (+1 point for successfully isolating the ring, but revealing the ring during elimination forfeits +2 points to the Hider). ## Formal model - **Abstraction taken:** The 3 sand mounds are represented as discrete cup indices C={0,1,2}. Bluffing signals and facial tells are formalized as a parameterized noisy observation channel O∈{0,1,2} with confidence parameter α∈[0,1]. - **Player/agent count:** 2 agents, Agent 0 (Hider) and Agent 1 (Detector). - **Turn model:** Sequential sub-phases within each round: (1) Secret placement, (2) Signal emission, (3) Detector action choice, (4) Score update and role evaluation. ## Formal rules R1. **Round Setup:** Three locations {0,1,2} are active. Score vector (S0,S1) initialized to (0,0). Target score K=10. R2. **Phase 1: Secret Placement:** - The Hider secretly selects location h∈{0,1,2}. - A noisy observation obs∈{0,1,2} is generated: P(obs=h)=13+23α,P(obs≠h)=1−α3 where α∈[0,1] models the Hider's tell leakage (default α=0.15). R3. **Phase 2: Detector Decision:** The Detector receives obs and selects one of two strategy types: - **Strategy A: Direct Guess (`DIRECT_GUESS`, g∈{0,1,2}):** - If g==h: Detector scores +3 points (S1←S1+3). Roles swap next round. - If g≠h: Detector scores +0 points, Hider scores +1 point (S0←S0+1). Hider retains hiding role. - **Strategy B: Sequential Elimination (`ELIMINATE`, e∈{0,1,2}):** - Detector declares location e as EMPTY. - If e==h (Accidental early find of the ring): Elimination fails. Hider scores +2 points (S0←S0+2). Hider retains hiding role. - If e≠h (Correct empty declaration): Location e is removed from candidate set. Detector must choose between the remaining 2 locations: - Detector declares second empty location e2∈{0,1,2}∖{e}. - If e2==h: Elimination fails. Hider scores +2 points. - If e2≠h: Ring is successfully isolated in the remaining 3rd location. Detector scores +1 point (S1←S1+1). Roles swap next round. R4. **Role Rotation:** Upon any round where the Detector successfully identifies the ring without failure, roles swap (Hider↔Detector) for the subsequent round. R5. **Victory Condition:** - The first agent to accumulate S≥10 points wins the match immediately. R6. [gap-fill] **Round Limit:** If neither agent reaches 10 points after R=30 rounds, the agent with the highest score wins (or a draw if tied). ## Edge cases - **Tie at the end condition:** If tied at round R=30, resolved as a draw. - **A player with no legal move:** Placement h∈{0,1,2} and guess/elimination choices are always legal. - **Repetition / cycles:** Bounded by round limit R=30. - **Simultaneous claims on the same resource or position:** Not applicable; sequential imperfect-information turn structure. - **Player elimination mid-round; turn order repair:** Not applicable (2-agent match). - **Resource exhaustion:** Finite discrete action space {0,1,2} and invariant target score. - **Termination guarantee:** Strictly bounded by R=30 and strictly positive score accumulation. ## State representation - **Persistent state:** - `scores`: `[score_0, score_1]`. - `hider_role`: `0` or `1`. - `round_number`: integer ∈[1,30]. - **Per-round ephemeral state:** - `hidden_location`: integer h∈{0,1,2} (private to Hider). - `signal`: integer obs∈{0,1,2} (observed by Detector). - `eliminated_set`: subset of {0,1,2}. - **Observable information:** Imperfect information: Detector observes obs, scores, and eliminated locations, but not h until resolution. ## Action space - Hider: `place_ring(location \in {0, 1, 2})`. - Detector: `direct_guess(location \in {0, 1, 2})`, `eliminate(location \in {0, 1, 2})`. ## Playability notes - **Single-player-vs-AI:** Natural 1v1 game. AI implements Bayesian belief updating over P(h|obs) and mixed-strategy equilibrium (randomizing placement across {0,1,2} to exploit risk-averse vs risk-seeking detectors). - **Group games (n>4):** Reduces cleanly to 2 competing agents (team captains making the placement and detection choices). - **Physical-skill games:** Not applicable (pure social deduction and Bayesian estimation). - **What is lost in the adaptation:** Nuances of physical micro-expressions, throat clearing, verbal poetry (*at-tahaji*), and group gaze misdirection. ## Implementation hints - Small state space: can be solved completely for Nash Equilibrium via linear programming or Counterfactual Regret Minimization (CFR). - First milestone: Implement deterministic direct guessing before adding sequential 2-stage elimination and Bayesian observation noise.

Download as JSON

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

Download JSON
Cite this page

Sahrawi hidden ring deduction game (El Juego del Anillo) (Western Sahara). (n.d.). Games of Countries. https://gamesofcountries.com/games/eh-western-sahara/labet-el-khatem

@misc{gamesofcountries-eh-western-sahara-labet-el-khatem,
  title = {Sahrawi hidden ring deduction game (El Juego del Anillo) (Western Sahara)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/eh-western-sahara/labet-el-khatem}
}