Skip to main content
Formal Specification

The Ring Game — Formal Specification

Kosovo · guessing-hidden · Confidence: low

← Back to game page

Implementation Suitability

Suitability: engine-readyFidelity: directGap-fills: 2
# Igra prstena — AI-optimized specification ## General idea A discrete, imperfect-information asymmetric bluffing game played across successive rounds between two opposing teams. One agent secretly hides a ring beneath one of 10 socks; the opposing searcher agent attempts either an immediate 1st-try discovery (+10 points) or a safe elimination of all 9 empty socks (+1 point). Intermediate revelations award the hider points equal to the remaining uninspected socks. ## Formal model - **Abstraction taken:** Team social interactions and eye-contact tells are modeled through imperfect-information hidden state selection and sequential reveal mechanics. - **Player counts:** 2 agents representing Team A and Team B (alternating Hider and Searcher roles). - **Turn model:** Two-phase sequential round structure: secret placement action followed by sequential reveals. ## Formal rules R1. **Initial State:** Target score T=101. Team scores ScoreA=0,ScoreB=0. Starting hider chosen uniformly at random [gap-fill]. R2. **Round Setup:** Socks set S={1,2,…,10}. Attempt counter k=1. R3. **Hiding Action:** The active Hider secretly selects ring location index r∈S. This value is hidden from the Searcher agent. R4. **Searcher Action Sequence:** On attempt k∈{1,…,10}, the Searcher selects sock index sk∈S. R5. **Attempt Resolution:** - If k=1 and s1=r: Immediate discovery! Searcher team gains +10 points. Searcher becomes Hider for next round. Round terminates. - If k<10 and sk≠r: Empty sock cleared. S←S∖{sk}. k←k+1. Searcher continues to next attempt. - If 1<k<10 and sk=r: Premature reveal fault. Hider team gains |S| points. Hider retains hiding role for next round. Round terminates. - If k=10 and s10=r: Full clearance sweep. Searcher team gains +1 point. Searcher becomes Hider for next round. Round terminates. R6. **Fault Penalty:** [gap-fill] If Searcher selects a previously removed sock index (sk∉S), it is scored as an immediate premature reveal fault. R7. **Match Victory:** As soon as either team reaches Score≥101 at the end of a round, the match terminates with that team victorious. ## Edge cases - **Tie at the end condition:** Not applicable; only one team earns points per round, making simultaneous crossing of the 101-point threshold impossible. - **A player with no legal move:** Not applicable; on every step in the search phase, the set of remaining socks S is non-empty (|S|≥1). - **Repetition / cycles:** In each round, at most 10 choices are made before the round terminates with positive integer point additions. Monotonic score accumulation prevents infinite game loops. - **Simultaneous claims on the same resource or position:** Not applicable; round phases are strictly sequential. - **Player elimination mid-round / turn order repair:** Not applicable; 2-agent alternating game. - **Resource exhaustion:** Sock set S is completely restored to {1,…,10} at the start of every new round. - **Termination guarantee:** Each round awards between 1 and 10 points to one team. The match provably terminates in at most 101 rounds. ## State representation - **Persistent state:** - `score_A`, `score_B`: Integers ∈[0,∞) - `hider_role`: Enum {Team A,Team B} - **Per-round ephemeral state:** - `ring_secret`: Integer ∈{1,…,10} (hidden from Searcher) - `available_socks`: Bitset of size 10 (public) - `attempt_counter`: Integer ∈[1,10] (public) - **Observable information:** - Hider observes: all scores, role assignments, `ring_secret`, `available_socks`, `attempt_counter`. - Searcher observes: all scores, role assignments, `available_socks`, `attempt_counter` (`ring_secret` is masked). ## Action space - `hide_ring(sock_id)`: parameter `sock_id` ∈{1,…,10}. Precondition: `phase == HIDING_PHASE`. - `reveal_sock(sock_id)`: parameter `sock_id` ∈available_socks. Precondition: `phase == SEARCHING_PHASE`. ## Playability notes - **Single-player-vs-AI:** Natural. Human can play either role against an AI employing Bayesian belief tracking over hiding habits. - **Group games (n>4):** Multi-player posela teams reduce directly to 2 decision agents (Captains). - **Physical-skill games:** Not applicable; pure information-theoretic bluffing and deduction game. - **What is lost in the adaptation:** The rich social atmosphere of winter *posela*—fireplace warmth, plum brandy toasts, and micro-facial poker tells. ## Implementation hints - Structurally isomorphic to `loja-e-kapucave` with target score T=101. Can share the exact same underlying discrete game engine core. - First milestone: Verify that random searcher achieves expected payoff of +1.0 per round vs uniform hider.

Download as JSON

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

Download JSON
Cite this page

The Ring Game (Kosovo). (n.d.). Games of Countries. https://gamesofcountries.com/games/xk-kosovo/igra-prstena

@misc{gamesofcountries-xk-kosovo-igra-prstena,
  title = {The Ring Game (Kosovo)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/xk-kosovo/igra-prstena}
}