Skip to main content
Formal Specification

Ring-Hiding Choral Game — Formal Specification

Sri Lanka · guessing-hidden · Confidence: high

← Back to game page

Implementation Suitability

Suitability: engine-readyFidelity: directGap-fills: 2
# Mevara Keliya — AI-optimized specification ## General idea Mevara Keliya is a traditional Sri Lankan hidden-information passing and guessing game. While seated in a circle chanting traditional stanzas (*Mevara Kavi*), circle players secretly pass a golden bangle or ring (*mevaraya*) from hand to hand (or beneath mounds of sand). At the conclusion of the song, a central Seeker must observe body language, hand positions, and subtle behavioral tells to correctly accuse the player concealing the item. ## Formal model - **Abstraction taken:** Direct hidden-information formalization. Circle of `N` players arranged circularly `0..N-1`. The ring object resides at hidden player index `H in {0..N-1}`. During `M = 4` musical verse steps, adjacent players secretly pass or hold the ring. The Seeker receives a vector of noisy visual/behavioral observation cues for each player. - **Player/agent count:** 1 Seeker agent, `N` Circle agents (`N in {6..12}`, or 1 macro Circle Controller managing all passers). - **Turn model:** 4-step hidden Markov passing phase, followed by 1 accusation decision. ## Formal rules R1. Setup: - Circle players indexed `0..N-1` clockwise. - Initial hidden ring location `H_0` is uniformly sampled from `{0..N-1}`. - One agent is designated as the Seeker; remaining agents act as Passers. - Seeker has 0 points and 0 strikes. R2. Passing Phase (The Choral Chant): - Over `M = 4` verse lines, the player `H` currently holding the ring submits a secret action: - `HOLD`: Keep the ring. - `PASS_LEFT`: Transfer ring to `(H - 1) mod N`. - `PASS_RIGHT`: Transfer ring to `(H + 1) mod N`. - Players without the ring execute simulated passing motions (feints). R3. Signal & Tell Generation: - [gap-fill] Each step, every player `i` emits a behavioral cue `Tell_i in [0.0, 1.0]`: - If player `i` holds the ring: `Tell_i ~ Normal(0.70 - 0.30 * Poker_Face_Skill, 0.15)`. - If player `i` is bluffing: `Tell_i ~ Normal(0.30, 0.15)`. - Seeker observes the complete cue vector `[Tell_0, ..., Tell_{N-1}]`. R4. The Accusation: - At the end of verse 4, the Seeker selects one accused player `A in {0..N-1}`. R5. Resolution & Role Rotation: - If `A == H_final`: Guess is correct. Seeker scores 100 points. The caught player `H_final` becomes the new Seeker for the next round. - If `A != H_final`: Guess is incorrect. Circle players score 50 points. Seeker receives 1 Strike. - [gap-fill] If Seeker accumulates 3 consecutive incorrect guesses, Seeker incurs a forfeit penalty, and a new Seeker is selected at random. R6. Match Termination: - Match consists of `R = N` total rounds so every player has the opportunity to seek. Highest individual score wins. ## Edge cases - Tie at the end condition: Equal scores result in a shared victory or a 1-round sudden death seeking round. - A player with no legal move: Not applicable — Pass/Hold actions and Accuse selections are always valid. - Repetition / cycles: Bounded strictly by the 4-verse passing phase and the `R = N` round limit. - Simultaneous claims on the same resource: Not applicable — exactly 1 ring exists in the system at all times. - Player elimination mid-round: Players are not eliminated; roles rotate upon successful capture. - Resource exhaustion: None — the ring is indivisible and permanently conserved. - Termination guarantee: Round count strictly increments after every accusation, guaranteeing match termination in `N` rounds. ## State representation - Persistent state: - `player_scores` (array of integers for all `N+1` participants). - `current_seeker_id` (integer `0..N`). - `round_number` (integer `1..N`). - Per-turn ephemeral state: - `hidden_ring_holder` (integer `0..N-1` — hidden from Seeker). - `verse_step` (integer `1..4`). - `observed_tells` (array of floats `0.0..1.0` per player — visible to Seeker). - `passing_history` (list of internal transfers — hidden from Seeker). - Observable information: Partially observable — Passers know their own hand state and neighbor transfers; Seeker observes only the behavioral tell distributions and final frozen postures. ## Action space - `circle_action(action_type)`: - `action_type in {"HOLD", "PASS_LEFT", "PASS_RIGHT"}` (executed by ring holder). - `accuse_player(player_id)`: - `player_id in {0..N-1}` (executed by Seeker). ## Playability notes - Single-player-vs-AI: Excellent Bayesian deduction / social deduction game. The Seeker uses maximum likelihood estimation over observed tells to infer the ring's location. - Group games (n>4): Naturally supports 6 to 20 players without alteration. - Physical-skill games: Purely cognitive hidden information deduction; zero physical mechanics. - What is lost in the adaptation: The lyrical singing of Sinhala folk stanzas (*Mevara Kavi*) and the tactile feeling of burying hands in cool river sand. ## Implementation hints Extremely simple hidden-information state engine. Can be modeled in under 90 lines of code. Milestone 1: implement circular Markov ring passing, Gaussian tell generation, Seeker Bayesian inference module, and role swap state transitions.

Download as JSON

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

Download JSON
Cite this page

Ring-Hiding Choral Game (Sri Lanka). (n.d.). Games of Countries. https://gamesofcountries.com/games/lk-sri-lanka/mevara-keliya

@misc{gamesofcountries-lk-sri-lanka-mevara-keliya,
  title = {Ring-Hiding Choral Game (Sri Lanka)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/lk-sri-lanka/mevara-keliya}
}