Skip to main content
Formal Specification

Lao Hide and Seek (also known as Lee Paeng) — Formal Specification

Laos · hide-seek · Confidence: low

← Back to game page

Implementation Suitability

Suitability: engine-readyFidelity: discretizedGap-fills: 4
# Lee Son — AI-optimized specification ## General idea Lee Son is a traditional Lao hide-and-seek game featuring a central home base post (*lak*). One designated Seeker (*phou ha*) closes their eyes at the base post during a counting phase, allowing Hiders (*phou lee*) to disperse into concealment zones. During the seeking phase, the seeker searches to spot hiders and sprint back to tag the base post, while hiders attempt to sneak past the seeker to strike the base post and declare themselves free (*Poat!*). If the final hider reaches the base post, they achieve full group liberation (*Poat thang mot!*). ## Formal model - **Abstraction taken:** Continuous 2D terrain, line-of-sight occlusions, and physical running speeds are mapped to an undirected spatial graph G=(V,E). Node v0 represents the home base post (*lak*), and peripheral nodes v1…vk possess occlusion/cover values C(v)∈[0.0,1.0]. - **Player/agent count:** N agents (3≤N≤15): 1 Seeker (S), N−1 Hiders (H1…HN−1). - **Turn model:** Two-phase structure: Phase 1 (Concealment, simultaneous dispersion over Tcount=5 ticks); Phase 2 (Search and Base-Race, simultaneous movement ticks up to Tmax=60 ticks) [gap-fill: Tcount=5,Tmax=60]. ## Formal rules R1. Initial Setup: - All agents start at base node v0. - Seeker state: position=v0, status = `BLIND_COUNTING`. - Hider states: captured=false, freed=false, spotted=false. R2. Phase 1 (Concealment): - For t∈[1,Tcount], each Hider may traverse 1 edge per tick along G to reach a hiding node vi. - Seeker remains stationary at v0 with vision disabled. R3. Phase 2 (Search & Detection): - Each tick, all agents move simultaneously to adjacent nodes or remain stationary. - Line of Sight: Seeker has visibility over node u if distance d(S,u)≤Rvis and clear line of sight exists. - Spotting check: A hider at node u is spotted with probability P(spot)=1.0−C(u). Once spotted, status becomes spotted(Hi)=true. R4. Base Race Resolution: - If Seeker spots Hi, a race to v0 occurs. - If Seeker reaches v0 before Hi: Hi becomes `CAPTURED` (captured(Hi)=true). - If Hi reaches v0 before Seeker tags v0 for them: Hi declares `Poat!` and becomes `FREED` (freed(Hi)=true). R5. Group Liberation (*Poat Thang Mot*): - If exactly 1 uncaptured hider remains, and that hider successfully reaches v0 before the seeker tags it, all previously `CAPTURED` hiders are restored to `FREED`. - Seeker receives a failure penalty and must repeat as Seeker in the next round [gap-fill]. R6. Round Termination & Role Handover: - The round ends when all hiders are either `CAPTURED` or `FREED`, or when t=Tmax. - If all hiders are `CAPTURED`, the first hider captured becomes the new Seeker for the subsequent round. - If any hiders remain uncaptured at Tmax, unspotted hiders are ruled `FREED` [gap-fill]. ## Edge cases - **Tie at the end condition:** If Seeker and Hider reach base node v0 on the exact same tick, the hider is awarded the `Poat!` tag (advantage to runner) [gap-fill]. - **A player with no legal move:** Not applicable; stationary wait (`wait()`) is always a legal action. - **Repetition / cycles:** Bounded by strict round timeout Tmax=60 ticks. - **Simultaneous claims on the same resource or position:** Multiple hiders may occupy the same hiding node; spotting check is evaluated independently per hider. - **Player elimination mid-round; turn order repair:** Captured hiders transition to spectator status at v0 and take no further actions unless liberated by R5. - **Resource exhaustion:** Not applicable; graph nodes and movement steps are inexhaustible within the tick limit. - **Termination guarantee: why the game provably ends:** Phase 1 lasts exactly 5 ticks; Phase 2 is hard-bounded by Tmax=60 ticks, ensuring complete round termination in at most 65 ticks. ## State representation - Persistent state: Graph topology G=(V,E), node cover ratings C(v), global seeker ID, match round history. - Per-tick ephemeral state: Agent positions (pS,pH1…pHm), status maps (`spotted`, `captured`, `freed`), active tick counter t∈[1,60]. - Observable information: Asymmetric information — Seeker observes only nodes within line of sight; Hiders observe full local surroundings and audible base calls. ## Action space - `move(target_node)`: Move to an adjacent connected node in G. Precondition: edge (pi,target_node)∈E. - `wait()`: Remain stationary at current node to maintain maximum cover. - `tag_base(target_hider_id)`: (Seeker only) Tag base post v0 to lock in capture of spotted hider. - `claim_poat()`: (Hider only) Strike base post v0 to secure self or group liberation. ## Playability notes - Single-player-vs-AI: Excellent as a stealth/patrol AI game, playing either as Seeker (sweeping zones and guarding home base) or Hider (timing stealth dashes to the base). - Group games (n>4): Naturally supports 3 to 15 agents in a multi-agent emergent coordination setting. - Physical-skill games: Physical sprinting and spatial concealment are abstracted into graph edge weights and node cover values. - What is lost in the adaptation: The physical darkness, auditory tension of muffled footsteps, and outdoor sensory landscape around Lao stilt houses. ## Implementation hints Represent the environment as a 2D grid graph with obstacle walls representing stilt houses and trees. Implement Seeker behavior using a finite state machine: `PATROL` → `INVESTIGATE` → `SPRINT_TO_BASE`. Milestone 1: Implement graph movement, line of sight raycasting, and base-tag race; Milestone 2: Add group liberation logic and multi-agent coordination.

Download as JSON

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

Download JSON
Cite this page

Lao Hide and Seek (also known as Lee Paeng) (Laos). (n.d.). Games of Countries. https://gamesofcountries.com/games/la-laos/lee-son

@misc{gamesofcountries-la-laos-lee-son,
  title = {Lao Hide and Seek (also known as Lee Paeng) (Laos)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/la-laos/lee-son}
}