Skip to main content
Formal Specification

Mauritanian sand-mound ring game (Dafen el-Khatem) — Formal Specification

Mauritania · guessing-hidden · Confidence: medium

← Back to game page

Implementation Suitability

Suitability: engine-readyFidelity: directGap-fills: 0
# Labet el-Khatem — AI-optimized specification ## General idea A multi-round asymmetric hidden-information game. The Concealer team buries a single ring under one of M identical sand mounds. The Seeker team sequentially flattens mounds deemed empty (scoring incremental points) or makes a definitive target declaration to capture the ring and score bonus points while avoiding premature accidental exposure. ## Formal model - **Abstraction taken:** Direct representation of a hidden index k∗∈{1,…,M} (M=9 mounds). Sand surface irregularities and psychological cues are modeled as a noisy signal vector 𝐬∈ℝM, where si∼𝒩(μk∗,σ2). - **Player/agent count:** 2 opposing teams (Concealer TC, Seeker TS). - **Turn model:** Two phases per round: 1 secret burial action by TC, followed by sequential elimination actions by TS. ## Formal rules R1. **Mound Setup & Secret Placement:** - M=9 mounds indexed 1…9, active set U={1,…,9}. - Concealer TC secretly selects ring mound k∗∈U. - Noisy perceptual signal 𝐬 is emitted: si=𝕀(i=k∗)⋅δsignal+ϵi, where ϵi∼𝒩(0,1). R2. **Seeker Actions:** - On each inquiry step, Seeker TS chooses one of two actions: - `eliminate_mound(i)`: where i∈U. - If i≠k∗: Mound i is empty. U←U∖{i}. TS scores +1 point and may act again. - If i==k∗: Ring is prematurely struck and exposed. TS fails immediately: TC scores +2 points, and round ends. - `declare_ring(i)`: where i∈U. - If i==k∗: **Successful Discovery!** TS scores +3 points, and roles swap for next round (TS→TC). - If i≠k∗: **Failed Declaration!** TC scores +2 points, and TC retains the concealing role. R3. **Victory Condition:** - Rounds continue until one team reaches target score Starget=10 points. ## Edge cases - **Tie at the end condition:** Not applicable — scores update strictly at round resolution; first team to reach ≥10 wins. - **A player with no legal move:** Active mounds always provide legal elimination or declaration actions. - **Repetition / cycles:** Bounded by monotonic score growth; each round awards ≥1 point, guaranteeing termination within ≤15 rounds. - **Simultaneous claims on the same resource or position:** Turns within a round are strictly ordered (TC places →TS acts). - **Player elimination mid-round; turn order repair:** Not applicable. - **Resource exhaustion:** Exactly 1 ring and a fixed array of M=9 mounds. - **Termination guarantee:** Guaranteed by finite round step horizon (≤9 queries) and non-decreasing match scores. ## State representation - **Persistent state:** Team scores (SC,SS), target score Starget, round count r, current concealing team ID. - **Per-round state:** Secret ring index k∗, active remaining mounds U⊆{1,…,9}, signal vector 𝐬. - **Observable information:** Imperfect information: TS observes only active mound set U and noisy signal vector 𝐬; k∗ is hidden until round resolution. ## Action space - For TC: `bury_ring(mound_index)` where mound_index∈{1,…,9}. - For TS: - `eliminate_mound(mound_index)`: mound_index∈U. - `declare_ring(mound_index)`: mound_index∈U. ## Playability notes - **Single-player-vs-AI:** Excellent: AI Seeker uses Bayesian belief updating over signal vector 𝐬 to optimize the decision threshold between sequential elimination (greedily accumulating +1 points) and final declaration (+3 points). - **Group games (N>2):** Reduces naturally to 2 decision-making agents representing the opposing teams. - **Physical-skill games:** Not applicable (pure Bayesian deduction, bluffing, and risk-management game). - **What is lost in the adaptation:** The physical sensation of sifting soft Sahara sand through fingers and watching firelight flickers on opponents' faces. ## Implementation hints - Implement the Seeker agent with a discrete belief state b(i)=P(k∗=i) updated via Bayes' rule after observing 𝐬. - First milestone: Implement 9-mound state machine with uniform random placement and direct scoring verification.

Download as JSON

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

Download JSON
Cite this page

Mauritanian sand-mound ring game (Dafen el-Khatem) (Mauritania). (n.d.). Games of Countries. https://gamesofcountries.com/games/mr-mauritania/labet-el-khatem

@misc{gamesofcountries-mr-mauritania-labet-el-khatem,
  title = {Mauritanian sand-mound ring game (Dafen el-Khatem) (Mauritania)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/mr-mauritania/labet-el-khatem}
}