Skip to main content
Formal Specification

Tigers and Cows (also known as Khla Si Chrouk) — Formal Specification

Cambodia · board-abstract · Confidence: low

← Back to game page

Implementation Suitability

Suitability: engine-readyFidelity: directGap-fills: 2
# Khla Si Kou — AI-optimized specification ## General idea A deterministic, perfect-information 2-player asymmetric hunt board game played on a 31-node graph (a 5x5 grid with diagonals augmented by two triangular wing lairs). One player commands 2 agile predatory Tigers (*Khla*) capable of short-leap captures and multi-jump chains, while the other commands a herd of 24 Cows (*Kou*) dropped one-by-one to form an impenetrable blockade. The game models the tactical tension between individual high-mobility predator leaping and collective distributed spatial cordons. ## Formal model - **Abstraction taken:** None — direct formalization of the 31-node hunt graph topology and traditional rules. - **Player/agent count:** 2 asymmetric agents: PTiger (controlling 2 Tiger pieces) and PCow (controlling 24 Cow tokens). - **Turn model:** Sequential, strictly alternating. PCow moves first by placing 1 Cow. ## Formal rules R1. Board Topology: Undirected graph G=(V,E) with |V|=31 vertices. The primary board consists of a 5x5 grid with all orthogonal and diagonal intersecting lines (25 vertices), augmented on two opposite sides by triangular 3-vertex extension wings representing the Tiger's Lair (*Troak*), adding 6 vertices. R2. Initial Setup: - 2 Tiger pieces are placed at the apex vertices of the two triangular wings (vT1,vT2). - The Cow player holds 24 Cow tokens in reserve (RCow=24). The 25 grid vertices start unoccupied. R3. Phase 1 (Placement & Hunt Phase): While RCow>0: - **Cow Turn:** PCow places 1 Cow token from reserve onto any unoccupied vertex v∈V; RCow←RCow−1. Cows cannot move along edges during Phase 1. - **Tiger Turn:** PTiger selects one Tiger at vertex u and executes either: - (a) *Step Move:* Move along an edge (u,v)∈E to an adjacent unoccupied vertex v. - (b) *Leap Capture:* Leap over an adjacent Cow at vertex w into an immediately collinear unoccupied vertex z (where (u,w)∈E, (w,z)∈E, and (u,w,z) forms a straight line on the board). The jumped Cow at w is permanently captured and removed from the board. - (c) *Multi-Leap:* If after landing at z another collinear leap capture is available, the Tiger may continue jumping in the same turn. R4. Phase 2 (Movement Phase): When RCow==0: - Turn order remains strictly alternating. - **Cow Turn:** PCow selects 1 on-board Cow and moves it 1 step along an edge (u,v)∈E to an adjacent unoccupied vertex v. Cows cannot jump or capture. - **Tiger Turn:** PTiger moves 1 Tiger by single step or leap-capture (including multi-leaps). R5. Win and Draw Conditions: - **Cows Win:** If at the start of PTiger's turn, both Tigers have zero legal moves (completely surrounded with no empty adjacent vertices and no legal leap captures). - **Tigers Win:** If the total number of surviving Cows on the board drops to ≤12, rendering successful containment mathematically impossible. - **Draw:** [gap-fill] If the exact same board position and side to move recurs 3 times (threefold repetition), or [gap-fill] if 100 consecutive plies occur in Phase 2 without a Cow capture. ## Edge cases - **Tie at the end condition:** A draw is declared exclusively via threefold repetition or the 100-ply captureless move limit (R5). - **A player with no legal move:** If PTiger has no legal move on their turn, PCow wins immediately (R5). If PCow has no legal move in Phase 2 (all surviving Cows blocked), PTiger is awarded the victory. - **Repetition / cycles (and the loop-breaking rule):** Explicitly bounded by the threefold repetition rule and the 100-ply capture clock (R5). - **Simultaneous claims on the same resource or position:** Not applicable — turns are strictly sequential; vertices can host at most 1 token. - **Player elimination mid-round; turn order repair:** Not applicable — 2-player game; game terminates immediately upon reaching win/draw conditions. - **Resource exhaustion:** Cow reserve depletes from 24 to 0, triggering Phase 2 transition; surviving Cow tokens monotonically decrease under Tiger captures. - **Termination guarantee: why the game provably ends:** Phase 1 strictly terminates after exactly 24 Cow drops; Phase 2 terminates because each capture permanently reduces board tokens, and non-capturing cycles are terminated by the 100-ply clock and threefold repetition rule. ## State representation - `vertices`: array of length 31 with values ∈{EMPTY,TIGER,COW}. - `cow_reserve`: integer in 0..24. - `active_turn`: ∈{COW,TIGER}. - `phase`: ∈{PHASE_1_DROP,PHASE_2_MOVE}. - `halfmove_clock`: integer counting plies since last capture. - `position_history`: hash table tracking board position frequencies for repetition detection. - Observable information: Fully observable by both agents with zero hidden state. ## Action space - For Cow in Phase 1: `drop_cow(vertex_id)` where `vertices[vertex_id] == EMPTY`. - For Cow in Phase 2: `move_cow(from_v, to_v)` where `(from_v, to_v) in E` and `vertices[to_v] == EMPTY`. - For Tiger: `step_tiger(from_v, to_v)` or `leap_tiger(path_sequence)` where `path_sequence` is a valid single or multi-jump collinear capture chain. ## Playability notes - **Single-player-vs-AI:** Highly suitable for standard Minimax / Alpha-Beta search or Monte Carlo Tree Search (MCTS) with asymmetric evaluation heuristics (Tiger mobility/threat count vs. Cow cluster connectivity and perimeter enclosure). - **Group games (n>4):** Not applicable; inherently a 2-player asymmetric duel. - **What is lost:** Nothing — discrete perfect-information graph formalization retains 100% of ethnographic game rules. ## Implementation hints - Precompute an adjacency list `ADJ[31]` and a collinear jump lookup table `JUMP[from_v][over_v] -> land_v` to make move generation extremely fast. - Average branching factor: Cow drops ~10–25 in Phase 1; Cow moves ~15–30 in Phase 2; Tiger moves ~4–12. - Suggested first milestone: Implement graph connectivity, move validation, and drop-phase simulation before building the multi-jump recursion resolver.

Download as JSON

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

Download JSON
Cite this page

Khla Si Kou (Cambodia). (n.d.). Games of Countries. https://gamesofcountries.com/games/kh-cambodia/khla-si-kou

@misc{gamesofcountries-kh-cambodia-khla-si-kou,
  title = {Khla Si Kou (Cambodia)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/kh-cambodia/khla-si-kou}
}