Skip to main content
Formal Specification

Indonesian Hide and Seek / Delikan — Formal Specification

Indonesia · hide-seek · Confidence: medium

← Back to game page

Implementation Suitability

Suitability: engine-readyFidelity: discretizedGap-fills: 4
# Ucing Sumput — AI-optimized specification ## General idea An asymmetric multi-agent stealth, vision, and sprint-to-base game on a 2D discrete grid with occlusion obstacles. One Seeker agent patrols to spot hidden agents and race back to tag the home base node, while Hider agents exploit visual occlusions and the Seeker's absence to infiltrate and touch the home base, attempting individual safety or team-wide mass liberation. ## Formal model - **Abstraction taken:** Outdoor yard environment is discretized as a [0..30]×[0..30] integer grid with static obstacle/occlusion cells. Home base is at (15,15). Line of sight is calculated via Bresenham raycasting. - **Player/agent count:** 1 Seeker (S) and M∈[2..7] Hiders (H1…HM). - **Turn model:** Simultaneous tick execution (Δt=1 step). ## Formal rules R1. Setup: - Seeker starts at Base (15,15) with eyes closed for Tcount=20 ticks. - Hiders disperse across the grid during the first 20 ticks to take positions behind obstacles. R2. Vision & discovery: - At tick t>20, Seeker opens vision cone (360∘ or 120∘ directional arc, range R=12 cells, obstructed by walls) [gap-fill]. - If Seeker has un-occluded line of sight to Hider Hi, Hi is marked `SPOTTED`. R3. Base Tagging Race: - If Seeker is at Base (15,15) and has spotted Hi, Seeker may execute action `tag_spotted(H_i)`: Hi transitions to `CAPTURED` and is immobilized at the base. - If Hider Hi reaches Base (15,15) without being captured and executes `tag_base_safe()`, Hi transitions to `SAFE`. R4. Mass Liberation (*Hong Merdeka*): - If the last remaining active (un-captured) Hider reaches Base (15,15) and executes `tag_hong_merdeka()`, all `CAPTURED` hiders instantly transition to `SAFE` [gap-fill]. - Seeker is declared DEFEATED and must repeat the Seeker role next round. R5. Round end conditions: - Seeker Victory: All Hiders are `CAPTURED`. The first captured hider becomes the next round's Seeker. - Hider Victory: All Hiders reach `SAFE` status (or mass liberation triggered). - Timeout [gap-fill]: If round reaches Tmax⁡=500 ticks, uncaptured hiders are automatically declared `SAFE`. ## Edge cases - Tie at the end condition: If Seeker and Hider reach Base (15,15) on the exact same tick, the Hider's safety tag takes precedence [gap-fill]. - A player with no legal move: (0,0) (remain stationary/hidden) is always legal. - Repetition / cycles: Bounded by finite tick limit Tmax⁡=500 ticks. - Simultaneous claims on the same resource or position: Base cell (15,15) allows multi-occupancy; tagging actions are resolved via priority rules (R3/R4). - Player elimination mid-round: Captured hiders remain stationary at Base and cannot act until round ends or liberated. - Resource exhaustion: Not applicable. - Termination guarantee: Enforced by finite time horizon Tmax⁡=500 ticks. ## State representation - Persistent state: - `seeker`: `{x, y, spotted_hiders: []}`. - `hiders`: array of `{id, x, y, status: HIDDEN|SPOTTED|CAPTURED|SAFE}`. - `obstacles`: set of integer grid coordinates `(x, y)`. - `current_tick`: integer 0..500. - Observable information: - **Partially observable:** Seeker only observes cells within line-of-sight cone. Hiders observe a local radius (r=8 cells) around themselves. Base status is public. ## Action space - `move(dx, dy)`: dx,dy∈{−1,0,1}. - Seeker: `tag_spotted(hider_id)` (precondition: on base, target is SPOTTED). - Hider: `tag_base_safe()`, `tag_hong_merdeka()` (precondition: on base). ## Playability notes - Single-player-vs-AI: Excellent benchmark for POMDP (Partially Observable Markov Decision Process) multi-agent stealth and pursuit-evasion algorithms. - Group games (n>4): Naturally reduces to 1 Seeker vs 2 Hiders without altering mechanics. - Physical-skill games: Physical sprinting and concealment are modeled through grid distances and raycasted line-of-sight checks. - What is lost in the adaptation: The somatic thrill of holding one's breath behind a banana tree while hearing the seeker's footsteps approach is abstracted into sight vectors. ## Implementation hints Standard 2D grid with 2D array representation and raymarching/Bresenham for visibility masks. First milestone: Implement 1 Seeker vs 1 Hider on a grid with 4 box obstacles to test line-of-sight tagging and base race triggers.

Download as JSON

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

Download JSON
Cite this page

Indonesian Hide and Seek / Delikan (Indonesia). (n.d.). Games of Countries. https://gamesofcountries.com/games/id-indonesia/ucing-sumput

@misc{gamesofcountries-id-indonesia-ucing-sumput,
  title = {Indonesian Hide and Seek / Delikan (Indonesia)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/id-indonesia/ucing-sumput}
}