Skip to main content
Formal Specification

Hide and Seek — Formal Specification

Nepal · hide-seek · Confidence: low

← Back to game page

Implementation Suitability

Suitability: engine-readyFidelity: discretizedGap-fills: 2
# Lukamari — AI-optimized specification ## General idea Lukamari is a multi-agent asymmetric hide-and-seek game played on a bounded 2D grid containing obstacles (cover nodes). One Seeker hunts for hidden agents while Hiders attempt to stay out of the Seeker's line of sight and sprint to the Home Base to execute a safety tag (*Dhyappa!*). ## Formal model - **Abstraction taken:** Environment is modeled as a 2D grid map M∈{0,1}W×H (0=open path,1=obstacle/cover). Line of sight (LOS) is computed via Bresenham ray-casting. - **Player/agent count:** N agents (1 Seeker, N−1 Hiders). - **Turn model:** Phase 1 (Count/Hide: Thide=20 ticks), followed by Phase 2 (Simultaneous ticked search: Δt=1 s). ## Formal rules R1. Setup: Home Base is located at fixed grid coordinate B=(xbase,ybase). R2. Phase 1 (Concealment): - Seeker is immobilized at B with zero visibility for 20 ticks. - Hiders move up to 1 cell per tick (4-directional orthogonal) to reach cover positions (x,y) that break LOS from B. R3. Phase 2 (Active Search and Sprint): - At each tick t, all active agents choose an action ∈{NORTH,SOUTH,EAST,WEST,STAY}. - Seeker line of sight (LOS): Seeker projects 360-degree vision rays up to vision range Rvision=8 cells, blocked by obstacle cells (M(x,y)=1). R4. Spotting Mechanism: - If Hider j falls within Seeker's unblocked LOS, Hider j is SPOTTED →Spottedj←True. - Once spotted, Seeker may tag Hider j by reaching Home Base B or touching Hider j's cell. R5. Home Base Tag (*Dhyappa*): - If any Hider k reaches cell B before being tagged by the Seeker, Hider k executes `TAG_DHYAPPA()`. - Hider k is declared SAFE and removed from active pursuit. - [gap-fill] If the last remaining active Hider executes *Dhyappa*, all previously caught hiders are rescued → Seeker loses round and must repeat as seeker. R6. Round Resolution: - If all hiders are either tagged or safe, the round terminates. - The first hider tagged becomes the Seeker for the next round. R7. Match Termination: Match runs for 10 rounds; the agent with fewest rounds as seeker wins. ## Edge cases - Tie at the end condition: If Seeker and Hider reach Base B simultaneously on the exact same tick, [gap-fill] Hider achieves *Dhyappa* successfully. - A player with no legal move: `STAY` action is always valid. - Repetition / cycles: Bounded by finite maximum ticks per round (Tmax=120 ticks). - Simultaneous claims on the same resource or position: Handled explicitly by cell collision rules (multiple agents can occupy open cells). - Player elimination mid-round: Tagged or safe hiders transition to spectator state until next round. - Resource exhaustion: None. - Termination guarantee: Guaranteed by hard round tick timeout (Tmax=120) and finite round count. ## State representation - `grid_map`: 2D binary matrix W×H. - `seeker_position`: (xseek,yseek). - `hider_positions`: Array of coordinates [(x1,y1),…,(xN−1,yN−1)]. - `hider_status`: Array ∈{HIDING,SPOTTED,SAFE,TAGGED}. - `base_coordinate`: (xb,yb). - `tick_counter`: Integer t∈[0,120]. ## Action space - `move(direction)`: Select ∈{NORTH,SOUTH,EAST,WEST,STAY}. - `tag_dhyappa()`: Valid only when occupying Base B. ## Playability notes - Single-player-vs-AI: Highly engaging as a stealth/chase grid AI challenge (both playing as Seeker and as Hider). - Group games (n>4): Standard benchmark for multi-agent reinforcement learning (MARL). - Physical-skill games: Real-world occlusion and sprinting abstracted into grid LOS ray-casting and cell transitions. - What is lost in the adaptation: Physical 3D contortions of squeezing into small hideaways. ## Implementation hints Standard 2D grid world. Use Bresenham line algorithm for fast LOS ray-tracing. First milestone: build the 15×15 grid environment with 20% random obstacle density and test shortest-path A* pathfinding to Base B.

Download as JSON

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

Download JSON
Cite this page

Hide and Seek (Nepal). (n.d.). Games of Countries. https://gamesofcountries.com/games/np-nepal/lukamari

@misc{gamesofcountries-np-nepal-lukamari,
  title = {Hide and Seek (Nepal)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/np-nepal/lukamari}
}