Skip to main content
Formal Specification

The Tray Game — Formal Specification

Iraq · guessing-hidden · Confidence: high

← Back to game page

Implementation Suitability

Suitability: engine-readyFidelity: directGap-fills: 2
# Al-Siniya — AI-optimized specification ## General idea A Northern Iraqi / Kurdish team guessing game (*Sênî u Zerf*). A bead is hidden under one of 11 upside-down bronze cups on a round copper tray. The searchers take turns lifting empty cups to isolate the bead. Empty cups score points for the hiders, while uncovering the bead prematurely awards points and ends the round. ## Formal model - **Abstraction taken:** Tray modeled as a discrete set of 11 cups C={0,1,…,10}. Bead position is an integer B∈C. - **Player/agent count:** 2 teams (Thide,Tsearch) of 3 to 8 players. - **Turn model:** 1 Secret Hiding Phase, followed by sequential cup lifts by the search team. ## Formal rules R1. **Initial setup:** 11 cups arranged on the tray. Thide secretly places bead under cup B∈[0,10] and shuffles cup positions under a cloth. R2. **Lifting sequence:** Tsearch selects cups one by one to lift: - **First-turn discovery:** If the searcher lifts cup B on their **first attempt** of the round: 0 points awarded to either side, and Tsearch immediately wins the tray (becomes hiding team next round). - **Empty cup lifted:** If the lifted cup is empty, it is removed. Thide scores **1 point** [gap-fill]. - **Subsequent bead discovery:** If the searcher lifts cup B on attempt k≥2: - Round ends. - Thide keeps all points scored in this round (k−1 points). - Thide retains the tray to hide again. - **Perfect clear (10 empty cups lifted):** If searchers lift all 10 empty cups leaving only B: Thide scores 10 points, and Tsearch wins the tray for the next round [gap-fill]. R3. **Victory condition:** First team to accumulate 101 points (or 51 points in fast format) wins the match. ## Edge cases - **Tie at the end condition:** Sudden death round if score ties at ≥101. - **A player with no legal move:** Search team must choose among remaining unlifted cups. - **Repetition / cycles:** Maximum 11 lifts per round guarantees termination. - **Simultaneous claims:** Turn-based choice by the search leader. - **Player elimination mid-round:** Not applicable (team-level score tracking). - **Resource exhaustion:** 11 cups, fixed per round. - **Termination guarantee:** Provably terminates via strictly increasing point accumulation towards 101 points. ## State representation - **Persistent state:** `scores: Dict[Team, int]`, `active_hiding_team: Team`. - **Ephemeral state:** `bead_cup: int \in [0, 10]`, `unlifted_cups: Set[int]`, `lifts_in_round: int`. - **Observable information:** Search team observes set of unlifted cup IDs and hider behavioral vectors. ## Action space - `hide_bead(cup_id)`: Selects target cup under cloth. - `lift_cup(cup_id)`: Searcher action revealing chosen cup. ## Playability notes - **Single-player-vs-AI:** Operates as a shell-game risk management and bluffing optimization problem. - **Group games (n>4):** Native team discussion and consensus guessing. - **Physical-skill games:** Micro-expression reading mapped to noisy probabilistic observations. - **What is lost:** Clink of heavy bronze cups, sweet paste on the tray rim, and Kirkuk teahouse ambience. ## Implementation hints Discrete state machine with an integer score counter and random choice generation.

Download as JSON

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

Download JSON
Cite this page

The Tray Game (Iraq). (n.d.). Games of Countries. https://gamesofcountries.com/games/iq-iraq/al-siniya

@misc{gamesofcountries-iq-iraq-al-siniya,
  title = {The Tray Game (Iraq)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/iq-iraq/al-siniya}
}