Skip to main content
Formal Specification

Ring guessing game (Thoumliht) — Formal Specification

Morocco · guessing-hidden · Confidence: medium

← Back to game page

Implementation Suitability

Suitability: engine-readyFidelity: directGap-fills: 1
# Labet el-Khatem — AI-optimized specification ## General idea A multi-round asymmetric hidden-information and bluffing game. The Concealer secretly places a single token (ring) into one of 2K possible hands (left/right of K agents). The Seeker sequentially eliminates empty hands or makes a final target guess based on behavioral signals, prior probabilities, and bluffing patterns. ## Formal model - **Abstraction taken:** Direct representation of a discrete hidden state H∗∈{1,…,2K}. The psychological cues and micro-expressions are abstracted as noisy signal vectors emitted by the Concealer team: 𝐬∈ℝ2K where si∼𝒩(μH∗,σ2). - **Player/agent count:** 2 opposing sides (Concealer TC, Seeker TS), each consisting of K agents (K∈[2,5], default K=4, representing 2K=8 hands). - **Turn model:** Two-phase rounds: 1 simultaneous hidden placement by TC, followed by sequential elimination actions by TS. ## Formal rules R1. **Setup & Roles:** - At round r, one team is designated Concealer (TC), and the other is Seeker (TS). - Hand indices: H={1,2,…,2K}. - TC chooses secret ring location h∗∈H. R2. **Signal Generation (Psychological Modeling):** - [gap-fill] For each hand i∈H, an observable cue si=𝕀(i=h∗)⋅δtell+ϵi is generated, where ϵi∼𝒩(0,1) and δtell∈[0,2.0] represents the concealer's bluffing imperfection (skill parameter). R3. **Seeker Elimination Actions:** - On each inquiry step, TS chooses one of two actions: - `eliminate_hand(i)`: TS asserts hand i is empty. - If i≠h∗, hand i is revealed empty and removed from active set (H←H∖{i}). TS earns +1 bonus point and may act again. - If i==h∗, the ring is prematurely exposed: TS fails immediately, TC scores +1 point, and round ends. - `declare_ring(i)`: TS makes a final definitive guess that hand i==h∗. - If i==h∗, TS succeeds: TS scores +3 points, and roles swap for next round (TS→TC). - If i≠h∗, TS fails: TC scores +2 points, and TC retains the concealing role. R4. **Victory Condition:** - Rounds continue until one team reaches a target score Starget=7 points. ## Edge cases - **Tie at the end condition:** Not applicable — points are awarded strictly sequentially at round resolution; first team to hit ≥7 wins. - **A player with no legal move:** TS always has at least one active hand to eliminate or declare. - **Repetition / cycles:** Bounded by monotonic score increments; each round awards ≥1 point, guaranteeing game end in at most 14 rounds. - **Simultaneous claims on the same resource or position:** Turns within a round are strictly ordered (TC places →TS queries). - **Player elimination mid-round; turn order repair:** Not applicable. - **Resource exhaustion:** Exactly 1 ring and a fixed set of 2K hands. - **Termination guarantee:** Each round strictly terminates in ≤2K queries, and total score strictly increases each round toward Starget=7. ## State representation - **Persistent state:** Team scores (SC,SS), target score Starget, current round index r, current concealing team ID. - **Per-round state:** Secret ring index h∗∈{1,…,2K}, set of active remaining hands Hactive⊆H, signal vector 𝐬. - **Observable information:** Imperfect information: TS observes only Hactive and noisy signal vector 𝐬; h∗ is hidden until round resolution. ## Action space - For TC: `place_ring(hand_index)` where hand_index∈{1,…,2K}. - For TS: - `eliminate_hand(hand_index)`: where hand_index∈Hactive. - `declare_ring(hand_index)`: where hand_index∈Hactive. ## Playability notes - **Single-player-vs-AI:** Excellent: AI concealer optimizes mixed strategies across hands to counter seeker Bayesian inference; AI seeker applies particle filtering or maximum-likelihood estimation over signal cues. - **Group games (N>4):** Naturally reduces to a 2-agent duel (1 Concealer vs 1 Seeker) controlling 2K virtual hands without altering any mathematical properties. - **Physical-skill games:** Not applicable (pure deduction, Bayesian estimation, and bluffing game). - **What is lost in the adaptation:** The electric social tension of staring into friends' eyes across a Berber carpet under candlelight. ## Implementation hints - Implement the Seeker agent as a Bayesian belief updater over a discrete categorical distribution P(H∗=i|𝐬). - First milestone: Build a 2-player 4-hand (K=2) environment with uniform random placement and direct accuracy evaluation.

Download as JSON

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

Download JSON
Cite this page

Ring guessing game (Thoumliht) (Morocco). (n.d.). Games of Countries. https://gamesofcountries.com/games/ma-morocco/labet-el-khatem

@misc{gamesofcountries-ma-morocco-labet-el-khatem,
  title = {Ring guessing game (Thoumliht) (Morocco)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/ma-morocco/labet-el-khatem}
}