Formal Specification
Snatching the Green Leaves (also known as Danh Kbal Khla) — Formal Specification
Cambodia · chase-tag · Confidence: low
← Back to game pageImplementation Suitability
Suitability: engine-readyFidelity: discretizedGap-fills: 2
# Danh Sleuk Chhoeu — AI-optimized specification
## General idea
A two-team agility, feinting, and sprint-tag game played on a linear field. A caller calls a secret number, summoning matched opposing runners to a neutral center containing a leaf token. While the leaf rests on the ground, neither runner may touch the other; both circle and feint until one snatches the leaf and sprints for their home baseline while the other pursues to tag them.
## Formal model
- **Abstraction taken:** Continuous field maneuvering and standoff posturing are discretized onto a 1D positional axis meters with discrete simultaneous-commitment ticks during the central standoff and deterministic sprint/tag equations during the return dash.
- **Player/agent count:** 2 teams (), each with agents, plus 1 neutral `Caller` mechanism.
- **Turn model:** Round-based, with simultaneous micro-ticks during the active runner duel.
## Formal rules
R1. Field Geometry: 1D linear track meters. Team A base line at ; Team B base line at ; Central neutral circle at holding the leaf token.
R2. Team Rosters: Team A consists of agents ; Team B consists of . Initial scores .
R3. The Call: The caller selects an index . Agents and sprint from their respective baselines to the central circle .
R4. Central Standoff Duel:
- While the leaf token remains at , neither agent may touch the other.
- Each tick of the duel, both agents simultaneously select one action from: `FEINT_LUNGE`, `WATCH_AND_BRACE`, or `SNATCH_LEAF`.
- [gap-fill] Duel Payoff Mechanics:
- If both agents choose `WATCH_AND_BRACE` or `FEINT_LUNGE`: Standoff continues (max 20 duel ticks).
- If Agent chooses `SNATCH_LEAF` while chose `FEINT_LUNGE`: secures the leaf with a wide reaction head-start meters.
- If Agent chooses `SNATCH_LEAF` while chose `WATCH_AND_BRACE`: reacts instantly; head-start is narrow meters.
- If both agents simultaneously choose `SNATCH_LEAF`: A 50/50 tie-break awards possession with meters.
R5. Dash & Tag Resolution:
- Once the leaf is snatched by , becomes the Carrier sprinting toward , and becomes the Chaser.
- Distance to safety for Carrier is meters at speed ; distance for Chaser to intercept is at speed .
- If : Chaser tags Carrier before safety Team B scores 1 point ().
- Otherwise: Carrier crosses baseline untagged Team A scores 1 point ().
R6. [gap-fill] Match Win Condition: The first team to reach a target score of points wins the match.
## Edge cases
- **Tie at the end condition:** If both teams reach 10 points simultaneously (in team variants with multiple active runners), sudden-death single-runner duels continue until a 1-point advantage is established.
- **A player with no legal move:** Not applicable — every agent called has valid standoff and sprint actions.
- **Repetition / cycles (and the loop-breaking rule):** Central duel standoff is strictly capped at 20 ticks; if no agent snatches within 20 ticks, the caller calls a standoff timeout, awarding 0 points and starting the next round.
- **Simultaneous claims on the same resource or position:** Both agents choosing `SNATCH_LEAF` simultaneously resolves via symmetric 50/50 possession assignment with (R4).
- **Player elimination mid-round; turn order repair:** Players are not eliminated; roster size remains constant throughout all rounds.
- **Resource exhaustion:** Leaf token is retrieved and placed back at after every round.
- **Termination guarantee: why the game provably ends:** Guaranteed because every round scores points, standoff ticks are capped at 20, and points accumulate monotonically toward .
## State representation
- `scores`: array of 2 integers .
- `current_runner_A`: agent ID .
- `current_runner_B`: agent ID .
- `leaf_state`: .
- `duel_tick`: integer in .
- `round_count`: integer.
- Observable information: Fully observable by both teams and active dueling agents.
## Action space
- For dueling agents during standoff: `commit_duel_action(action)` where `action` .
- For caller: `call_number(k)` where .
## Playability notes
- **Single-player-vs-AI:** Natural 1v1 reaction and psychological baiting game against an AI agent implementing mixed strategies over feinting and snatching.
- **Group games (n>4):** Native team model with runners taking sequential duels.
- **Game-theoretic core:** Standoff models a classic timing/chicken matrix where early snatch is risky against `WATCH`, but safe against `FEINT`.
- **What is lost:** Physical explosive acceleration and footwork dexterity are mapped to reaction head-start mathematics and speed constants.
## Implementation hints
- Model the central standoff as a discrete Markov Decision Process (MDP) or 2x2 matrix game with state transitions into deterministic kinematic pursuit.
- Extremely lightweight: can be implemented in under 60 lines of logic.
Download as JSON
Download the full game corpus entry for this game as structured JSON.
Download JSONCite this page
Snatching the Green Leaves (also known as Danh Kbal Khla) (Cambodia). (n.d.). Games of Countries. https://gamesofcountries.com/games/kh-cambodia/danh-sleuk-chhoeu
@misc{gamesofcountries-kh-cambodia-danh-sleuk-chhoeu,
title = {Snatching the Green Leaves (also known as Danh Kbal Khla) (Cambodia)},
year = {n.d.},
publisher = {Games of Countries},
url = {https://gamesofcountries.com/games/kh-cambodia/danh-sleuk-chhoeu}
}