Skip to main content
Formal Specification

Hawk Catching the Hen's Chicks (also known as Khleng Chab Koun) — Formal Specification

Cambodia · chase-tag · Confidence: low

← Back to game page

Implementation Suitability

Suitability: engine-readyFidelity: discretizedGap-fills: 2
# Khleng Chab Koun Moan — AI-optimized specification ## General idea An asymmetric pursuit-evasion and line-defense game modeled on a 2D discrete grid. A mobile Hawk agent sweeps across flanks attempting to tag the terminal node of an N-length kinematic snake chain (the Chicks), while the Mother Hen agent pivots and screens with outstretched wings to block the Hawk's line of approach. ## Formal model - **Abstraction taken:** Continuous physical swinging and bodily shielding of a connected human chain are discretized into a linked kinematic snake chain C=[p0,p1,…,pK] on a 15×15 grid, where p0 is the Mother Hen and pK is the vulnerable tail chick. Adjacent segment distances are constrained to |pi−pi−1|∞≤1. - **Player/agent count:** 2 decision agents: `Hawk` (H) and `MotherHen` (M) controlling K trailing chick nodes. - **Turn model:** Simultaneous tick-based simulation (Δt=1 tick). ## Formal rules R1. Arena Setup: 15×15 discrete grid with coordinates (x,y)∈[0,14]2. R2. Initial Positions: Mother Hen M (p0) starts at (7,7). K Chick nodes p1…pK are positioned in a straight column directly behind M at (7,7−i) for i∈{1…K}. Hawk H starts at (7,12). R3. Movement per Tick: - Hawk H selects movement (ΔxH,ΔyH) with speed max⁡(|ΔxH|,|ΔyH|)≤2 cells. - Mother Hen M selects movement (ΔxM,ΔyM) with speed max⁡(|ΔxM|,|ΔyM|)≤1 cell. - Each chick node pi updates position to follow pi−1 with 1-tick delay: pi(t+1)←pi−1(t), maintaining chain continuity. R4. Collision, Screening, and Tagging: - H cannot move into or through cells occupied by M or intermediate chick bodies p0…pK−1. - Mother Hen M exerts a 1-cell lateral blocking zone across her front and sides: if H attempts to cross adjacent to M, forward movement along that vector is blocked. - If at tick resolution H occupies a cell orthogonally or diagonally adjacent to the tail chick pK without being blocked by M, pK is captured. - When captured, pK is removed from active play; chain length decrements K←K−1, and positions reset to starting standoff distance. R5. [gap-fill] Chain Break Rule: If extreme directional whipping causes a break (‖pi−pi−1‖>1), disconnected chicks freeze in place for 2 ticks to reconnect, during which they are immune to capture. R6. [gap-fill] Win Conditions: - **Hawk Wins:** If all K chicks are captured (K=0). - **Hen & Chicks Win:** If after Tmax⁡=100 ticks ≥1 chick remains uncaptured. ## Edge cases - **Tie at the end condition:** Evaluated at tick Tmax⁡=100; if K>0, Hen & Chicks win. - **A player with no legal move:** Movement vectors can be (0,0) (stationary idle), ensuring legal actions are always present. - **Repetition / cycles (and the loop-breaking rule):** Bounded by strict monotonic tick decrement toward Tmax⁡=100. - **Simultaneous claims on the same resource or position:** Resolved by kinematic priority: Mother Hen's blocking zone overrides Hawk penetration if both target adjacent cells. - **Player elimination mid-round; turn order repair:** When pK is tagged, K decrements by 1; the new tail chick becomes pK−1 in the next hunting sub-round. - **Resource exhaustion:** Active chicks strictly decrease from initial K→0. - **Termination guarantee: why the game provably ends:** Guaranteed by finite tick cap Tmax⁡=100 per round. ## State representation - `hawk_pos`: coordinate (xH,yH). - `hen_pos`: coordinate (xM,yM). - `chick_chain`: array of coordinates [p1,…,pK]. - `chick_count`: integer K∈[0..18]. - `tick_counter`: integer in 0..100. - Observable information: Fully observable by both agents. ## Action space - For Hawk: `move_hawk(dx, dy)` where max⁡(|dx|,|dy|)≤2. - For Mother Hen: `move_hen(dx, dy)` where max⁡(|dx|,|dy|)≤1. ## Playability notes - **Single-player-vs-AI:** Highly playable — human controls Hawk attempting to find flanking vectors around AI Hen, or human controls Hen calculating angular intercepts to shield the trailing tail. - **Group games (n>4):** Reduces cleanly into the 2-agent controller framework where Hen controls the aggregate kinematic snake body. - **What is lost:** The physical centrifugal whip force experienced by trailing children, verbal antiphonal rhymes, and physical grip strength are mapped into 2D snake kinematics. ## Implementation hints - Implement the chick chain as a standard FIFO coordinate queue where pi(t+1)=pi−1(t). - Hen AI uses angular intercept math: θtarget=atan2(yH−ytail,xH−xtail). - Hawk AI uses Breadth-First Search (BFS) / A* pathfinding avoiding Hen's blocking radius.

Download as JSON

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

Download JSON
Cite this page

Hawk Catching the Hen's Chicks (also known as Khleng Chab Koun) (Cambodia). (n.d.). Games of Countries. https://gamesofcountries.com/games/kh-cambodia/khleng-chab-koun-moan

@misc{gamesofcountries-kh-cambodia-khleng-chab-koun-moan,
  title = {Hawk Catching the Hen's Chicks (also known as Khleng Chab Koun) (Cambodia)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/kh-cambodia/khleng-chab-koun-moan}
}