Skip to main content
Formal Specification

The Kurdish Hat Game — Formal Specification

Iraq · guessing-hidden · Confidence: high

← Back to game page

Implementation Suitability

Suitability: engine-readyFidelity: directGap-fills: 1
# Klawên — AI-optimized specification ## General idea A traditional Kurdish winter guessing game (*Klawkڵawên*). A ring (*Moker*) is hidden under one of 9 traditional woolen hats (*Klaw*) in a row. Searchers lift empty hats one by one to isolate the ring, awarding 1 point per empty hat to the hiders while attempting to trigger a turn transfer. ## Formal model - **Abstraction taken:** 9 hats indexed H={0,1,…,8}. Ring location is integer R∈H. - **Player/agent count:** 2 teams of 4 to 8 players (Thide,Tsearch). - **Turn model:** 1 Secret Hiding Phase, followed by sequential hat selections by the search team. ## Formal rules R1. **Initial setup:** 9 hats placed in a straight line. Thide secretly covers the hats and places ring under hat R∈[0,8]. R2. **Lifting sequence:** - **First-lift hit:** If the searcher lifts hat R on their very first attempt of the round: 0 points awarded to either side, and Tsearch immediately wins the right to hide. - **Empty hat lifted:** If the lifted hat is empty, it is removed from the active row. Thide scores **1 point**. - **Subsequent hit:** If the searcher lifts hat R on attempt k≥2: - Round terminates immediately. - Thide keeps all points scored in this round (k−1 points). - Thide retains the right to hide in the next round. - **All 8 empty hats lifted:** If searchers successfully lift all 8 empty hats leaving only R, Thide scores 8 points, and Tsearch wins the right to hide in the next round [gap-fill]. R3. **Victory condition:** First team to achieve 100 points wins the match. ## Edge cases - **Tie at the end condition:** Sudden death round if score ties at ≥100. - **A player with no legal move:** Search team must choose from remaining unlifted hats. - **Repetition / cycles:** Maximum 9 lifts per round guarantees termination. - **Simultaneous claims:** Turn-based choice by the search captain. - **Player elimination mid-round:** Not applicable. - **Resource exhaustion:** 9 hats, constant. - **Termination guarantee:** Provably terminates via point accumulation towards 100. ## State representation - **Persistent state:** `scores: Dict[Team, int]`, `active_hiding_team: Team`. - **Ephemeral state:** `ring_hat: int \in [0, 8]`, `unlifted_hats: Set[int]`, `round_lift_count: int`. - **Observable information:** Searchers observe remaining hat indices and hider behavioral tells. ## Action space - `hide_ring(hat_id)`: Hider placement under cover. - `lift_hat(hat_id)`: Searcher reveals chosen hat. ## Playability notes - **Single-player-vs-AI:** Direct risk-reward puzzle against an AI hider/guesser. - **Group games (n>4):** Native team consensus play. - **Physical-skill games:** Micro-expression reading mapped to probabilistic observations. - **What is lost:** Tactile heavy woolen caps, rhythmic clapping, and Kurdish village *Bait* chants. ## Implementation hints Extremely simple discrete state machine. Can share core engine with `al-siniya` with parameterized hat/cup count (9 vs 11).

Download as JSON

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

Download JSON
Cite this page

The Kurdish Hat Game (Iraq). (n.d.). Games of Countries. https://gamesofcountries.com/games/iq-iraq/klawen

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