Skip to main content
Formal Specification

Cap and Ring Guessing Game / Cup Hiding — Formal Specification

North Macedonia · guessing-hidden · Confidence: low

← Back to game page

Implementation Suitability

Suitability: engine-readyFidelity: directGap-fills: 4
# Lojë me kapuça (Филџанаш) — AI-optimized specification ## General idea A two-team hidden-information deduction and bluffing game. The hiding team secretly deposits a token under one of ten cups/caps. The guessing team attempts either an all-or-nothing direct hit on guess 1 (awarding maximum points and swapping roles) or sequentially eliminates empty caps without accidentally finding the token prematurely. ## Formal model - **Abstraction taken:** The physical arrangement of 10 caps is modeled as an array of 10 discrete slots indexed 0..9. The physical sleight-of-hand deposit is formalized as a uniform or biased secret integer choice H∈{0..9}. Micro-expression and behavioral tells can be modeled as noisy perceptual signals si∈[0,1] generated per cap. - **Player/agent count:** 2 teams (Team Hiding TH and Team Guessing TG), each represented by a decision-making agent. - **Turn model:** Sequential rounds until target score (Starget=101) is reached. ## Formal rules R1. **Round Initialization:** Array C=[1,1,1,1,1,1,1,1,1,1] representing 10 active caps. Hider agent TH submits action `hide_token(slot)` with slot∈{0..9}, setting secret state H=slot. R2. **Guessing Phase:** TG submits action `guess_cap(slot, mode)` where mode∈{DirectTarget,SafeEliminate} and C[slot]=1. R3. **Direct Target Resolution (Mode 1):** - If TG selects mode=DirectTarget on guess 1: - If slot=H: TG scores +10 points, round ends, and roles swap (TG↔TH). - If slot≠H: C[slot]←0, and TG must transition to SafeEliminate mode. R4. **Safe Elimination Resolution (Mode 2):** - If TG selects mode=SafeEliminate for cap k: - If k≠H: C[k]←0 (successfully eliminated). TG continues to guess from remaining active caps. - If k=H: TG has failed the elimination sweep. Round ends immediately. TH scores points equal to remaining unlifted caps ∑i=09C[i], and TH retains the hiding role for the next round. R5. **Full Sweep Clearance:** If TG successfully eliminates all 9 empty caps leaving only ∑C[i]=1 with C[H]=1, TG scores +10 points, round ends, and roles swap (TG↔TH). R6. [gap-fill] Signal Noise Model:** Implementers modeling human tells may provide TG with an observation vector σ→=(σ0…σ9), where σi=𝕀(i=H)+ϵi, ϵi∼𝒩(0,σnoise2). R7. [gap-fill] Match Termination:** The first team to reach ≥Starget=101 points wins the match. R8. [gap-fill] Sleeve Hiding Ban:** H must strictly be an integer in {0..9}; withholding the token from all caps is illegal and verified automatically by the game state engine. ## Edge cases - Tie at the end condition: Not applicable; scores update sequentially per round, and the first team to cross 101 points wins immediately. - A player with no legal move: In guessing phase, any active cap with C[i]=1 is legal. - Repetition / cycles: Bounded; every round guarantees non-negative integer point awards (≥1 point per failed sweep, or 10 on success), ensuring monotonic score increase toward 101. - Simultaneous claims on the same resource or position: Turns are strictly sequential between hider and guesser. - Player elimination mid-round: Not applicable; team-level scoring persists across rounds. - Resource exhaustion: Caps are reset to 10 at the start of every new round. - Termination guarantee: [gap-fill] Every round awards at least 1 point to one of the teams; thus total score monotonically increases and must reach 101 in at most 101 rounds. ## State representation - **Persistent state:** Team scores (SH,SG), active hider team Tactive, total rounds played. - **Per-round ephemeral state:** Hidden token location H∈{0..9}, cap availability array C∈{0,1}10, current guess count g∈[1,10]. - **Observable information:** Cap availability C and scores are public. Token location H is strictly private to TH until round resolution. ## Action space - `hide_token(slot)`: slot∈{0..9}. Precondition: caller is TH at round start. - `guess_cap(slot, mode)`: slot∈{0..9} with C[slot]=1, mode∈{DirectTarget,SafeEliminate}. ## Playability notes - Single-player-vs-AI: Highly playable; human against an AI hider/guesser with Bayesian belief updating over cap locations. - Group games (n>4): Reduces naturally to 1v1 agent decisions representing the team captains. - Physical-skill games: None; pure game of probability, risk assessment, and bluffing. - What is lost in the adaptation: The atmospheric winter evening banter, singing satirical folk verses, and face-to-face micro-expression reading. ## Implementation hints Extremely low complexity. The entire engine is a 10-element binary array and a secret integer. First milestone: implement R1–R5 and verify that random guessing yields the theoretical expected point distribution.

Download as JSON

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

Download JSON
Cite this page

Cap and Ring Guessing Game / Cup Hiding (North Macedonia). (n.d.). Games of Countries. https://gamesofcountries.com/games/mk-north-macedonia/loje-me-kapuca

@misc{gamesofcountries-mk-north-macedonia-loje-me-kapuca,
  title = {Cap and Ring Guessing Game / Cup Hiding (North Macedonia)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/mk-north-macedonia/loje-me-kapuca}
}