Formal Specification
Ring Game — Formal Specification
Bosnia & Herzegovina · guessing-hidden · Confidence: high
← Back to game pageImplementation Suitability
Suitability: engine-readyFidelity: directGap-fills: 3
# Igra prstena — AI-optimized specification
## General idea
A discrete, imperfect-information asymmetric bluffing and deduction game between a Hiding agent and a Seeking agent across an array of 10 or 12 containers (socks). The Hider selects a hidden index under cover, while the Seeker faces a risk-reward dilemma: attempt an immediate high-payoff single guess or sequentially eliminate empty containers while risking premature catastrophic failure. Points accumulate over alternating rounds until a threshold is reached.
## Formal model
- **Abstraction taken:** The physical movement of hands under a blanket is formalized as a secret index selection where or . The Seeker's manual lifting gestures are formalized into two discrete action primitives: `strike(i)` (declaring the ring is under index ) and `eliminate(i)` (asserting index is empty and removing it from the candidate set).
- **Player/agent count:** 2 agents representing Team A and Team B (roles alternate based on round outcome).
- **Turn model:** Sequential phase-based turns within a round: Hiding phase Seeking phase Scoring/Role update.
## Formal rules
R1. **Setup:** Container array size (or ). Active candidate set . Target match score . Score totals . Initial role assignment (Hider = A, Seeker = B) chosen randomly.
R2. **Hiding phase:** The active Hider secretly selects container index . The value of is added to the hidden state and concealed from the Seeker.
R3. **Seeking phase:** The Seeker iteratively chooses actions from the legal action set on remaining active containers :
- R3.1. `strike(i)` where :
- If (first move of the round) and : Seeker's team gains points (e.g., 9 points if , 11 points if ). The round ends immediately; Seeker becomes Hider for the next round.
- If and : Seeker fails. Hider's team gains points. The round ends immediately; Hider remains Hider for the next round.
- If and : Seeker's team gains 1 point. The round ends immediately; Seeker becomes Hider for the next round.
- If and : Hider's team gains 1 point. The round ends immediately; Hider remains Hider for the next round.
- [gap-fill] If and the Seeker executes `strike(i)`: If , Seeker's team gains points and becomes Hider; if , Hider's team gains points and remains Hider.
- R3.2. `eliminate(i)` where (valid only when ):
- If : Seeker accidentally reveals the ring during elimination (*premature bust*). Hider's team gains points immediately. The round ends; Hider remains Hider.
- If : Container is removed from candidate set (). If , the Seeker continues the seeking phase.
R4. **Round termination and role update:** When a round ends, points scored are added to the corresponding team's total. If Seeker found the ring legally, roles swap for the next round; otherwise, roles remain unchanged.
R5. **Win condition:** The game ends immediately when any team reaches . The team with the higher score wins. [gap-fill] If both reach on the same round (impossible under asymmetric scoring, but if playing symmetric rounds), the higher score wins; if exactly tied, sudden-death single-sock rounds continue until a point lead is established.
## Edge cases
- **Tie at the end condition:** Only one team scores points in any given round, so scores strictly diverge or increment monotonically; if playing fixed-round matches ending in a tie, sudden-death rounds are played per R5 [gap-fill].
- **A player with no legal move:** Not applicable; Hider always has choices; Seeker always has at least one valid `strike` or `eliminate` action on the non-empty candidate set .
- **Repetition / cycles:** If the Seeker repeatedly fails and the Hider retains the hiding role, the Hider's score increases by at least 1 point every round, strictly bounding the maximum number of rounds before .
- **Simultaneous claims on the same resource:** Not applicable; turns and phases are strictly sequential.
- **Player elimination mid-round / turn order repair:** Not applicable in a 2-agent formalization; in multi-player teams, role delegation is internal to the agent.
- **Resource exhaustion:** The candidate set strictly decreases with each `eliminate` action down to size 2, at which point only `strike` is legal, guaranteeing the round terminates in at most actions.
- **Termination guarantee:** Each round executes at most discrete decisions and produces a strictly positive point award () to one team. Total score is bounded above by , so the entire game provably terminates in at most rounds.
## State representation
- **Persistent state:** `score_A: int`, `score_B: int`, `hider_role: AgentID`, `round_number: int`, `target_score: int`.
- **Per-round ephemeral state:** `hidden_ring_index: int` (visible only to Hider and Environment), `active_containers: Set[int]`, `phase: Enum{HIDING, SEEKING, RESOLVED}`.
- **Observable information set:**
- Hider observes: `active_containers`, `hidden_ring_index`, full score history.
- Seeker observes: `active_containers`, full score history, and past revealed empty containers; does NOT observe `hidden_ring_index`.
## Action space
- `select_hide_spot(container_id: int)`: Precondition: `phase == HIDING`, `container_id in active_containers`.
- `strike(container_id: int)`: Precondition: `phase == SEEKING`, `container_id in active_containers`.
- `eliminate(container_id: int)`: Precondition: `phase == SEEKING`, `len(active_containers) > 2`, `container_id in active_containers`.
## Playability notes
- **Single-player-vs-AI:** Highly natural; AI can operate as Hider (using mixed-strategy Nash equilibrium over sock positions) or Seeker (Bayesian belief updating over Hider's placement tendencies).
- **Group reduction:** Multi-player teams (4v4) collapse without loss of strategic integrity to 2 meta-agents making the consensus decision for their team.
- **Physical-skill games:** Not applicable; the physical hand-fluttering bluff is fully mapped to the discrete hidden information distribution.
- **What is lost:** Micro-tells, physiological bluffing cues, and live eye contact from the face-to-face blanket ritual are abstracted into mathematical mixed strategies.
## Implementation hints
- Very low computational complexity; state space is compact and can be solved analytically for optimal mixed strategies.
- Obvious trap: Forgetting to constrain `eliminate` when , where players must declare their final strike.
- Suggested first milestone: Implement a 10-sock round simulator with random Hider and heuristic Seeker to verify point accounting and role-swapping logic.
Download as JSON
Download the full game corpus entry for this game as structured JSON.
Download JSONCite this page
Ring Game (Bosnia & Herzegovina). (n.d.). Games of Countries. https://gamesofcountries.com/games/ba-bosnia-herzegovina/igra-prstena
@misc{gamesofcountries-ba-bosnia-herzegovina-igra-prstena,
title = {Ring Game (Bosnia & Herzegovina)},
year = {n.d.},
publisher = {Games of Countries},
url = {https://gamesofcountries.com/games/ba-bosnia-herzegovina/igra-prstena}
}