Skip to main content
Formal Specification

Guarding the Turtle Eggs (Turtle Nest Stealing Game) — Formal Specification

Myanmar · guessing-hidden · Confidence: low

← Back to game page

Implementation Suitability

Suitability: engine-readyFidelity: discretizedGap-fills: 3
# Leik-u-hwet-tam — AI-optimized specification ## General idea A traditional children's territory defense and stealth stealing game inspired by coastal sea turtles nesting. One player acts as the Mother Turtle (*Leik-ma*), squatting inside an inner nest circle to protect a clutch of eggs (pebbles). The other children (Raiders) dart inside the nest from the outer perimeter to snatch eggs one by one and carry them outside without being tagged by the defending turtle. ## Formal model - **Abstraction taken:** The circular court is discretized into concentric zones on a 2D grid [−3,3]×[−3,3] centered at (0,0). The *Nest Zone* is defined as Znest={(x,y)|x2+y2≤1}; the *Safety Zone* is Zsafe={(x,y)|x2+y2≥9} (outside radius 3). Movement is discretized into synchronous grid steps per tick. - **Player/agent count:** 1 Turtle agent T and K∈{3…9} Raider agents {R1…RK}. - **Turn model:** Synchronous discrete simulation ticks t=1,2,…,Tmax⁡. ## Formal rules R1. **Court & Initial Setup:** - Nest contains E0=6 eggs at (0,0). - Turtle T starts at (0,0) with facing angle θT∈{0,π2,π,3π2}. - All Raiders start in the safe outer perimeter Zsafe with inventory =0. R2. **Movement Constraints:** - *Turtle:* Must remain strictly inside Znest (x2+y2≤1). Maximum movement speed: 1 step or 90∘ rotation per tick. - *Raiders:* May move freely across the entire grid at speed 1 step per tick. R3. **Egg Snatching Mechanics:** - If a Raider Rj with inventory =0 is adjacent to (0,0) and executes `snatch_egg()`, 1 egg is transferred from the nest to Rj's inventory (Enest←Enest−1). - A Raider can carry at most 1 egg at a time. - Once Rj carries an egg back into Zsafe, the egg is secured permanently in the Raiders' score bank. R4. **Tagging & Capture Mechanics:** - The Turtle can execute `tag(direction)` covering an arc of radius rreach=1.5 grid units in front of the Turtle's current facing. - If any Raider is within this reach cone during the tick, that Raider is **Captured** (*Mi*). - If a capture occurs: the round ends immediately; the captured Raider becomes the Turtle for the next round. R5. **Nest Plunder (Raiders Win):** - If all E0 eggs are successfully secured in Zsafe without any Raider being tagged, the Raiders win the round. The Turtle is declared *Leik-kan* (blind/beaten) and must serve as Turtle again in the subsequent round. R6. [gap-fill] Tick Limit Per Round:** If neither all eggs are stolen nor a raider is tagged within Tmax⁡=150 ticks, the round ends; the Turtle is declared victorious for defending the nest, and the Raider with the fewest eggs secured becomes the new Turtle. ## Edge cases - Tie at the end condition: Standard round ends cleanly on first tag or when final egg is secured. On tick expiration (R6), Turtle wins defense [gap-fill]. - A player with no legal move: Not applicable; (0,0) stationary wait or step in any cardinal direction is always valid. - Repetition / cycles: Raiders lingering outside the nest are bounded by the hard tick cap Tmax⁡=150 in R6. - Simultaneous claims on the same resource or position: If multiple Raiders attempt `snatch_egg()` in the same tick with only 1 egg remaining, priority is resolved by lowest Raider ID [gap-fill]. Multiple simultaneous tags all result in a single round termination event. - Player elimination mid-round; turn order repair: If an individual raider disconnects, remaining eggs and raiders continue uninterrupted. - Resource exhaustion (pieces, tokens, space, time): Exactly E0=6 eggs exist; grid [−3,3]×[−3,3] is bounded. - Termination guarantee: why the game provably ends: Guaranteed by monotonic egg depletion (Enest→0) and the strict upper bound Tmax⁡=150 ticks. ## State representation - **Persistent state:** Number of players K+1, initial egg count E0=6, roles (`Turtle_ID`, `Raider_IDs`), cumulative match scores. - **Per-turn ephemeral state:** Tick t∈{1…150}, remaining nest eggs Enest, secured eggs Ebank, positions {pos(T),pos(R1)…pos(RK)}, Turtle facing θT, Raider inventories {0,1}K. - **Observable information:** Fully observable; all positions, egg counts, and inventories are visible to all agents. ## Action space - **Turtle Actions:** `move(direction)`, `rotate(angle)`, `tag(direction)`. - **Raider Actions:** `move(direction)`, `snatch_egg()`, `deposit_egg()`. ## Playability notes - Single-player-vs-AI: Highly playable as a stealth arcade game; human player controls the Turtle pivoting rapidly to tag multi-directional AI raiders, or plays a Raider coordinating feints. - Group games (n>4): Natively supports 4 to 10 agents running in a multi-agent gym environment. - Physical-skill games: Squatting reach agility and sudden perimeter sprints are discretized into spatial grid adjacency and reach cones. - What is lost in the adaptation: The tactile feel of digging eggs out of soft beach sand, laughter, and carrying winners on backs (*Danda-khat*). ## Implementation hints Low complexity. Simple 2D discrete grid with coordinate distance checks and egg inventory counters. First milestone: implement 1 Turtle vs 2 Raiders on a 7×7 grid and verify egg-snatch and tag-trigger terminations.

Download as JSON

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

Download JSON
Cite this page

Guarding the Turtle Eggs (Turtle Nest Stealing Game) (Myanmar). (n.d.). Games of Countries. https://gamesofcountries.com/games/mm-myanmar/leik-u-hwet-tam

@misc{gamesofcountries-mm-myanmar-leik-u-hwet-tam,
  title = {Guarding the Turtle Eggs (Turtle Nest Stealing Game) (Myanmar)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/mm-myanmar/leik-u-hwet-tam}
}