Skip to main content
Formal Specification

Drop the Handkerchief / Knotted Scarf Chase — Formal Specification

Kazakhstan · chase-tag · Confidence: low

← Back to game page

Implementation Suitability

Suitability: adaptation-requiredFidelity: discretizedGap-fills: 5
# Oramal tastau — AI-optimized specification ## General idea Oramal tastau is a traditional circle-chase and alertness game. Participants sit in an inward-facing circle while an active runner circles the outside perimeter and stealthily drops a knotted cloth scarf behind an unsuspecting player. If the seated player remains oblivious until the runner completes a full lap, they are penalized; if they detect the scarf in time, an explosive two-way sprint around the perimeter ensues to claim the vacated seat. ## Formal model - **Abstraction taken:** The continuous perimeter movement and physical seated vigilance are discretized into a circle graph of N nodes (seats 0..N−1). [gap-fill] The covert drop is modeled as a target seat selection k∈{0..N−1}; detection time by the seated agent is modeled as a stochastic latency Tdetect∼Exp(λalertness), which is tested against the runner's lap transit time Tlap. If detected, the resulting two-way sprint is resolved via a relative speed differential over the remaining arc distance. - **Player/agent count:** N agents (default N=8; reducible to a 2-agent duel with simulated bystander seats). - **Turn model:** Round-based; each round consists of a runner drop action followed by detection and sprint resolution. ## Formal rules R1. **Circle Topology and State Initialization:** - The playing space is a discrete circular ring of N seats indexed 0..N−1 in clockwise order. - Exactly 1 agent is assigned the role of active runner R; the remaining N−1 agents occupy fixed seats. - Each agent i has attributes: alertness λi∈[0.5,2.0] and sprint speed Vi∈[4.0,8.0] m/s. - [gap-fill] Each seated player starts with 0 penalty points (*aiyp*). R2. **The Drop Action:** - Runner R selects a target seat k∈{0..N−1} occupied by seated agent Pk. - Runner R chooses a running pace vR∈[3.0,6.0] m/s. - Lap completion time: Tlap=2πrvR (where circle perimeter 2πr≈25 m). R3. **Detection and Branching:** - Target agent Pk's detection delay is sampled: Tdetect=−ln⁡(U)λk, where U∼Uniform(0,1). - [gap-fill] Time available before runner returns to seat k: Twindow=Tlap⋅(1−kN). - **Branch 1: Oblivious Penalty (Tdetect≥Twindow):** - Pk fails to notice the scarf in time. - Pk receives +1 penalty point (*aiyp*). - Pk becomes the new active runner for the next round; the former runner R takes seat k. - **Branch 2: Detected Drop & Perimeter Sprint (Tdetect<Twindow):** - Pk detects the drop, stands up, and pursues runner R along the clockwise perimeter towards seat k. - Sprint distance remaining: Drem=2πr⋅(1−kN). - Runner travel time to seat: tR=Drem/VR. - Pursuer travel time to tag: tP=Tdetect+(Drem/VPk). - If tR<tP: Runner R reaches seat k safely; Pk becomes the new runner for next round. - If tP≤tR: Pursuer Pk tags the runner before seat k is reached; runner R remains the runner for another round, and Pk sits back down safely. R4. **End Condition and Match Winner:** - A match is contested over a fixed number of rounds (e.g. M=20 rounds). - The player with the lowest accumulated penalty points (*aiyp*) at the end of M rounds 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 R4 [gap-fill] (lowest penalty score wins; equal scores share joint victory). - **A player with no legal move:** Not applicable; the active runner always selects a target seat k∈{0..N−1} and a pace. - **Repetition / cycles (and the loop-breaking rule):** Tagging can result in the same runner trying multiple times; bounded by the strict M-round global game limit. - **Simultaneous claims on the same resource or position:** In Branch 2 sprint, arrival times tR and tP are compared continuously; tP≤tR strictly gives tag priority to pursuer. - **Player elimination mid-round; turn order repair:** Players are not eliminated; penalties accumulate in persistent state while roster remains constant. - **Resource exhaustion (pieces, tokens, space, time):** 1 scarf in play throughout; seat layout is fixed. - **Termination guarantee: why the game provably ends:** A match consists of a fixed, finite sequence of exactly M rounds. ## State representation - **Persistent state:** - `seats`: Array of N−1 player IDs. - `active_runner_id`: Player ID. - `penalties`: Map of `player_id -> int`. - `current_round`: Integer 1..M. - **Per-round ephemeral state:** - `target_seat`: Integer 0..N−1. - `detection_time`: Float. - `sprint_resolution`: Enum `[OBLIVIOUS_PENALTY, RUNNER_SAFE, RUNNER_TAGGED]`. - **Observable information:** Imperfect information during round execution. Seated players do not know if the scarf has been dropped behind them until their stochastic detection check succeeds; penalty totals are public knowledge. ## Action space - `drop_scarf(target_seat, pace)`: - Runner action; `target_seat` ∈{0..N−1}, `pace` ∈[3.0,6.0]. ## Playability notes - **Single-player-vs-AI:** Natural. 1 human player occupying a seat or acting as runner against AI bots with varied alertness/speed profiles. - **Group games (n>4):** Reduction to 2 agents: Agent 1 (Runner) vs Agent 2 (Target Seated Player) with N−2 automated background filler seats. - **Physical-skill games:** Physical alertness and sprinting are parameterized by λi∈[0.5,2.0] (reaction rate) and Vi∈[4.0,8.0] m/s (sprint velocity). - **What is lost in the adaptation:** Peripheral sound cues (footsteps on grass, clothing rustle), feigned innocent expressions by the passing runner, and social performance of comedic *aiyp* songs. ## Implementation hints - Model round resolution as a clean analytical pipeline: sample Tdetect, compute deterministic kinematic equations tR and tP, and branch state accordingly. - Strategic choice for runner: dropping behind high-alertness opponents is risky but leaves a shorter sprint gap; dropping behind low-alertness opponents maximizes oblivious penalty chance. - First milestone: Implement 8-player circle state, detection exponential sampling, sprint threshold comparisons, and verify round transitions over 20 rounds.

Download as JSON

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

Download JSON
Cite this page

Drop the Handkerchief / Knotted Scarf Chase (Kazakhstan). (n.d.). Games of Countries. https://gamesofcountries.com/games/kz-kazakhstan/oramal-tastau

@misc{gamesofcountries-kz-kazakhstan-oramal-tastau,
  title = {Drop the Handkerchief / Knotted Scarf Chase (Kazakhstan)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/kz-kazakhstan/oramal-tastau}
}