Skip to main content
Formal Specification

Hide and Seek / Taguan Pong — Formal Specification

Philippines · hide-seek · Confidence: low

← Back to game page

Implementation Suitability

Suitability: engine-readyFidelity: discretizedGap-fills: 3
# Taguan — AI-optimized specification ## General idea A simultaneous-tick imperfect-information hide-and-seek game on a 2D discrete grid with vision-occluding obstacles. The Seeker counts at a base landmark (0,0) for Tcount=20 ticks while Hiders disperse into concealing pockets. During the search phase, the Seeker searches for raycast line-of-sight to Hiders; upon spotting a Hider, a simultaneous race to the base cell determines whether the Hider is eliminated (*ponged*) or self-rescued (*saved*). A successful rescue by the final active hider triggers a full-team resurrection (*Save All*). ## Formal model - **Abstraction taken:** Arena is discretized into a 2D grid of size X∈[0..30],Y∈[0..30] containing static obstacle cells that block movement and occlude line-of-sight (LOS). Base is at (0,0). Field of view (FOV) is modeled via 2D Bresenham raycasting with maximum visual range Rvision=12 cells and angular cone θ=180∘ centered on the agent's facing direction. - **Player/agent count:** 1 Seeker (S) and k Hiders (H1..Hk), with k∈[2..5]. - **Turn model:** Simultaneous discrete execution ticks (Δt=1 step per round). ## Formal rules R1. Setup & Counting Phase: - Base is at coordinate (0,0). - Seeker S is locked at (0,0) with visual sensor disabled for ticks t∈[0..20]. - Hiders H1..Hk spawn at (0,0) and execute dispersion moves for 20 ticks into concealment cells. R2. Search Phase & Visibility: - At tick t>20, Seeker moves freely across unblocked cells. - Visibility check: Hider Hi is observed by S if Euclidean distance d(S,Hi)≤12, angle of Hi relative to S's heading ≤90∘, and no obstacle cell intersects the line segment SHi. R3. Base Race & Elimination (*Pong* vs *Save*): - When S observes Hi, state transitions to `CHASE_RACE(H_i)`: - Both S and Hi can attempt to navigate back to Base (0,0). - If S reaches (0,0) first: S executes `pong(H_i)`; Hi becomes `CAUGHT`, recorded in the caught queue Qcaught. - If Hi reaches (0,0) first: Hi executes `save()`; Hi becomes `SAVED` (immune for remainder of round). R4. Final Hider & Save-All Protocol: - If |Qcaught|==k−1 (only 1 hider remains in field) and that final hider Hlast reaches (0,0) before S: - Hlast executes `save_all()`. - All agents in Qcaught transition to `SAVED`; Seeker S receives penalty point and remains Seeker for next round [gap-fill]. R5. Round Succession & Match Termination: - Round terminates when all k hiders are either `CAUGHT` or `SAVED`, or at Tmax⁡=400 ticks. - If at least 1 hider is `CAUGHT` and no `save_all` occurred, the first agent in Qcaught becomes the new Seeker for the next round. - Match concludes after 3 complete rounds; agent with lowest seeker count wins [gap-fill]. ## Edge cases - Tie at the end condition: If Seeker and Hider reach (0,0) on the exact same tick, the tie is awarded to the Hider (`SAVED`) [gap-fill]. - A player with no legal move: (0,0) (remain stationary in hiding spot) is always legal. - Repetition / cycles: Bounded by hard countdown limit Tmax⁡=400 ticks per round. - Simultaneous claims on the same resource or position: Base coordinate (0,0) can receive simultaneous actions; priority resolves via Rule Edge Case 1. - Player elimination mid-round: Caught hiders become inactive observers at base until round reset. - Resource exhaustion: Not applicable. - Termination guarantee: Enforced by the finite tick limit Tmax⁡=400. ## State representation - Persistent state: - `grid_map`: 30×30 binary matrix (0 = open, 1 = wall/cover). - `agent_positions`: array of coordinates (x,y). - `agent_headings`: array of orientation angles θ. - `hider_status`: array of k enums (`HIDING`, `RACING_TO_BASE`, `CAUGHT`, `SAVED`). - `caught_queue`: FIFO list of caught agent IDs. - `current_seeker_id`: integer 0..k. - `current_tick`: integer 0..400. - Observable information: - Seeker observes only cells within unobstructed raycast FOV. - Hiders observe only cells within their own local raycast FOV (imperfect information). ## Action space - `move(dx, dy)`: Δx∈{−1,0,1},Δy∈{−1,0,1} with Manhattan norm ≤1. - `set_heading(theta)`: orientation angle [0,π/2,π,3π/2]. - `pong(target_id)`: Seeker action executed at Base (0,0). - `save()` / `save_all()`: Hider action executed at Base (0,0). ## Playability notes - Single-player-vs-AI: Highly compelling stealth-evasion game with fog-of-war vision sensors. - Group games (n>4): Scales naturally up to 6 hiders on a rich obstacle map. - Physical-skill games: Real-world acoustic listening and darkness concealment are formalized into directional LOS cones and obstacle occlusions. - What is lost in the adaptation: The atmospheric ambiance of nighttime shadows and whispered decoy sounds. ## Implementation hints Grid raycaster with FOV occlusion matrix. Use pathfinding (A*) for Seeker navigation to observed targets. First milestone: Implement 1 Seeker vs 1 Hider on a 15x15 map with 4 cover boxes to test LOS detection and Base racing.

Download as JSON

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

Download JSON
Cite this page

Hide and Seek / Taguan Pong (Philippines). (n.d.). Games of Countries. https://gamesofcountries.com/games/ph-philippines/taguan

@misc{gamesofcountries-ph-philippines-taguan,
  title = {Hide and Seek / Taguan Pong (Philippines)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/ph-philippines/taguan}
}