Skip to main content
Formal Specification

Ring Under the Caps — Formal Specification

Croatia · guessing-hidden · Confidence: low

← Back to game page

Implementation Suitability

Suitability: engine-readyFidelity: directGap-fills: 2
# Igra prstena — AI-optimized specification ## General idea An asymmetric hidden-information guessing and bluffing game. A hiding agent conceals a discrete token under one of K=10 cups; a searching agent sequentially discards cups believed to be empty to accumulate scoring multipliers, terminating with a direct strike on the target cup, with severe penalties if the token is exposed during an empty discard. ## Formal model - **Abstraction taken:** Psychological micro-expressions and body language tells are abstracted into a noisy binary cue signal vector 𝐬∈[0,1]K observed by the searcher upon inspecting each cup. - **Player/agent count:** 2 agents (Ahide,Aseek) or 2 teams of 3 agents. - **Turn model:** Asymmetric two-phase sequential round structure: (1) Concealment Choice, (2) Sequential Discard/Strike Search. ## Formal rules R1. Setup: - Array of K=10 cups indexed 0…9. - Target score Swin=21 points (*konji*). Team scores initialized: Shide=0,Sseek=0. R2. Concealment Phase: - Agent Ahide selects secret cup index c∗∈{0,…,9}. - Cup states initialized: status[k]=UNREVEALED for all k∈[0,9]. - [gap-fill] Searcher observes noisy probability vector 𝐩cue∈Δ9 where pcue[c∗]∼Beta(αtell,βtell). R3. Search Phase (Sequential Actions by Aseek): - Aseek chooses one of two actions on an unrevealed cup k: 1. `discard_empty(k)`: Searcher asserts cup k is EMPTY. - If k≠c∗: Cup k is marked REVEALED_EMPTY. Aseek continues turn. - If k==c∗: `FAULT (IZBAČEN PRSTEN)`. The search ends immediately. Ahide scores points equal to the number of remaining unrevealed cups: ΔS=|unrevealed|. Ahide retains hiding role. 2. `strike_ring(k)`: Searcher asserts cup k contains the RING. - If k==c∗: `SUCCESS`. - If done on first move (0 discards): Aseek scores 5 bonus points. - If done after d successful discards: Aseek scores d points. - Role turnover: Aseek becomes Ahide for next round. - If k≠c∗: `FALSE STRIKE`. Ahide scores points equal to |unrevealed|; Ahide retains hiding role. R4. Match Victory: - First agent/team to achieve S≥21 points wins the match. - [gap-fill] Turn horizon capped at M=30 rounds; highest score wins if cap reached. ## Edge cases - Tie at the end condition: Tied scores ≥21 broken by sudden-death 1-round hiding duel. - A player with no legal move: Searcher always has at least one unrevealed cup while round is active. - Repetition / cycles: Bounded by finite round limit M=30 and strictly positive score increments per round. - Simultaneous claims on the same resource or position: Actions within a round are strictly sequential. - Player elimination mid-round; turn order repair: In team play, captain handles the action selections; if captain disconnects, teammate assumes role. - Resource exhaustion: K=10 cups are reset to unrevealed state at start of each round. - Termination guarantee: Monotonically increasing score with strictly positive expected points per round (𝔼[ΔS]≥1.5) guarantees finite termination. ## State representation - Persistent state: `score_hide: int`, `score_seek: int`, `round_number: int`, `hider_id: int`. - Ephemeral round state: `secret_cup: int`, `cup_states: list[enum]`, `discards_count: int`, `round_resolved: bool`. - Observable information: Hider knows c∗; Seeker observes noisy cue vector 𝐩cue and history of revealed cups. ## Action space - `hide_token(cup_index: int)`: Hider placement action (idx∈[0,9]). - `discard_cup(cup_index: int)`: Searcher empty claim. - `strike_cup(cup_index: int)`: Searcher ring declaration. ## Playability notes - Single-player-vs-AI: Highly engaging; searcher solves an optimal stopping problem under Bayesian belief distributions over cup locations. - Group games (n>4): Natively designed for 4 to 12 agents. - Physical-skill games: Not applicable (discrete hidden-information strategy game). - What is lost: Live human eye contact, subtle nervous sweating, singing atmosphere around the woolen blanket. ## Implementation hints Direct discrete Bayesian decision process. First milestone: implement full rulebook with uniform random hider before adding reinforcement learning hider/seeker policies.

Download as JSON

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

Download JSON
Cite this page

Ring Under the Caps (Croatia). (n.d.). Games of Countries. https://gamesofcountries.com/games/hr-croatia/igra-prstena

@misc{gamesofcountries-hr-croatia-igra-prstena,
  title = {Ring Under the Caps (Croatia)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/hr-croatia/igra-prstena}
}