Skip to main content
Formal Specification

Passing the Ring / Dropping the Ring — Formal Specification

Kazakhstan · guessing-hidden · Confidence: low

← Back to game page

Implementation Suitability

Suitability: adaptation-requiredFidelity: discretizedGap-fills: 4
# Saqina salu — AI-optimized specification ## General idea Saqina salu is a traditional parlor game of stealth distribution, deceptive bluffing, and sudden physical reaction. Players sit in an inward-facing circle with pressed palms while a leader slides clasped hands between each player's palms, secretly dropping a silver ring into one chosen player's hands. Upon the leader's dramatic vocal trigger, the ring holder must spring into the center before their immediate left and right neighbors can react to restrain them. ## Formal model - **Abstraction taken:** The continuous yurt parlor gathering is formalized as a discrete circular topology of N seats (0..N−1). [gap-fill] The hidden ring drop is represented as a private binary state flag assigned to one agent; deceptive leader distribution generates noisy observation signals for adjacent neighbors; the sudden breakout vs restraint contest is modeled as a race condition between the holder's standing latency and the neighbors' restraint reaction times. - **Player/agent count:** N agents (default N=8; reducible to a 3-agent local duel: Holder vs Left Neighbor vs Right Neighbor). - **Turn model:** Sequential phase progression per round: (1) Stealth Distribution, (2) Breakout Trigger & Reaction Race, (3) Forfeit Allocation. ## Formal rules R1. **Circle Setup and Roles:** - N agents occupy seats 0..N−1 in cyclic order. - Exactly 1 agent is designated the Leader (L); the remaining N−1 agents are seated players. - Seats i−1(modN) and i+1(modN) are defined as the immediate left and right neighbors of seat i. - [gap-fill] Each seated player maintains an alertness attribute λi∈[1.0,3.0] and physical agility attribute Ai∈[1.0,3.0]. R2. **The Stealth Distribution Phase:** - Leader L secretly selects one seated agent k∈{0..N−1}∖{L} to receive the ring: holds_ring[k]←true, and holds_ring[j]←false for all j≠k. - For each visited seat j, Leader L allocates a dwell time dj∈[0.5,2.0] seconds. - Each neighbor m∈{k−1,k+1} receives a noisy observation cue Cm=𝕀(m suspects k)∼Bernoulli(pcue), where pcue=σ(1.5⋅(dk−1.0)−Ak). R3. **The Call & Breakout Race:** - Leader L issues the trigger command (`"Aq qoyanym yrshyp shyq!"`). - The ring holder k initiates a breakout with rising time Trise∼Exp(Ak). - The left neighbor (k−1) attempts to pin k with reaction time Tleft∼Exp(λk−1⋅(1+Ck−1)). - The right neighbor (k+1) attempts to pin k with reaction time Tright∼Exp(λk+1⋅(1+Ck+1)). - Restraint threshold: Let Tpin=min⁡(Tleft,Tright). R4. **Resolution and Penalties (*Aiyp*):** - **Successful Breakout (Trise<Tpin):** - Holder k breaks free into the center. - Both immediate neighbors (k−1) and (k+1) receive +1 penalty point (*aiyp*). - Holder k becomes the new Leader for the next round. - **Successful Restraint / Pin (Tpin≤Trise):** - Holder k is pinned to the ground before standing. - Holder k receives +1 penalty point (*aiyp*). - Holder k becomes the new Leader for the next round. R5. **End Condition and Match Winner:** - A match is contested over a fixed sequence of M=15 rounds. - The player with the lowest cumulative penalty score (*aiyp*) at match end is declared the winner. - [gap-fill] If multiple players tie with the lowest penalty score, tied players share joint victory. ## Edge cases - **Tie at the end condition:** Explicitly resolved by R5 [gap-fill] (lowest penalty score wins; equal scores share joint victory). - **A player with no legal move:** Not applicable; leader always chooses a recipient, and seated players execute reaction checks automatically upon trigger. - **Repetition / cycles (and the loop-breaking rule):** Role transfer is guaranteed every round; match terminates deterministically at round M. - **Simultaneous claims on the same resource or position:** If both left and right neighbors react simultaneously, their combined restraint simply locks the pin condition (Tpin=min⁡(TL,TR)). - **Player elimination mid-round; turn order repair:** No player elimination; all agents remain in the circle while penalties accumulate. - **Resource exhaustion (pieces, tokens, space, time):** Exactly 1 ring in play; circular seating graph is invariant. - **Termination guarantee: why the game provably ends:** A match consists of a strictly bounded sequence of M discrete rounds. ## State representation - **Persistent state:** - `seats`: Array of N agent IDs. - `current_leader_id`: Agent ID. - `player_penalties`: Map of `agent_id -> int`. - `current_round`: Integer 1..M. - **Per-round ephemeral state:** - `ring_recipient_id`: Hidden agent ID. - `neighbor_cues`: Map of `agent_id -> bool`. - `breakout_success`: Boolean flag. - **Observable information:** Asymmetric hidden information. The ring recipient's identity is known only to the Leader and the recipient until the breakout trigger; penalty totals and leader identity are public. ## Action space - `distribute_ring(recipient_id, dwell_times)`: - Leader action; `recipient_id` ∈seats∖{L}, `dwell_times` ∈[0.5,2.0]N. - `attempt_breakout()`: Ring holder reactive action. - `attempt_pin()`: Seated neighbor reactive action. ## Playability notes - **Single-player-vs-AI:** Natural. 1 human player in a seat (reading AI leader bluffing timing) or acting as Leader against AI bots. - **Group games (n>4):** Reduces cleanly to a 3-agent game (Holder vs Left Neighbor vs Right Neighbor) with an automated leader. - **Physical-skill games:** Physical agility and micro-expression detection are abstracted into parameters Ai,λi∈[1.0,3.0]. - **What is lost in the adaptation:** Physical warmth of palms, subtle eye contact and poker-face tension in the intimate yurt setting, and live vocal performance of forfeit songs. ## Implementation hints - Implement the hidden state distribution using a masked dictionary where only `recipient_id` and `leader_id` receive the true token flag. - Model the latency race condition using standard exponential random variables for high computational efficiency. - First milestone: Implement hidden distribution, exponential race resolution, role handover, and verify penalty accumulation over 15 rounds.

Download as JSON

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

Download JSON
Cite this page

Passing the Ring / Dropping the Ring (Kazakhstan). (n.d.). Games of Countries. https://gamesofcountries.com/games/kz-kazakhstan/saqina-salu

@misc{gamesofcountries-kz-kazakhstan-saqina-salu,
  title = {Passing the Ring / Dropping the Ring (Kazakhstan)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/kz-kazakhstan/saqina-salu}
}