Formal Specification
Hide and Seek / Taguan Pong — Formal Specification
Philippines · hide-seek · Confidence: low
← Back to game pageImplementation 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 for 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 containing static obstacle cells that block movement and occlude line-of-sight (LOS). Base is at . Field of view (FOV) is modeled via 2D Bresenham raycasting with maximum visual range cells and angular cone centered on the agent's facing direction.
- **Player/agent count:** 1 Seeker () and Hiders (), with .
- **Turn model:** Simultaneous discrete execution ticks ( step per round).
## Formal rules
R1. Setup & Counting Phase:
- Base is at coordinate .
- Seeker is locked at with visual sensor disabled for ticks .
- Hiders spawn at and execute dispersion moves for ticks into concealment cells.
R2. Search Phase & Visibility:
- At tick , Seeker moves freely across unblocked cells.
- Visibility check: Hider is observed by if Euclidean distance , angle of relative to 's heading , and no obstacle cell intersects the line segment .
R3. Base Race & Elimination (*Pong* vs *Save*):
- When observes , state transitions to `CHASE_RACE(H_i)`:
- Both and can attempt to navigate back to Base .
- If reaches first: executes `pong(H_i)`; becomes `CAUGHT`, recorded in the caught queue .
- If reaches first: executes `save()`; becomes `SAVED` (immune for remainder of round).
R4. Final Hider & Save-All Protocol:
- If (only 1 hider remains in field) and that final hider reaches before :
- executes `save_all()`.
- All agents in transition to `SAVED`; Seeker receives penalty point and remains Seeker for next round [gap-fill].
R5. Round Succession & Match Termination:
- Round terminates when all hiders are either `CAUGHT` or `SAVED`, or at ticks.
- If at least 1 hider is `CAUGHT` and no `save_all` occurred, the first agent in 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 on the exact same tick, the tie is awarded to the Hider (`SAVED`) [gap-fill].
- A player with no legal move: (remain stationary in hiding spot) is always legal.
- Repetition / cycles: Bounded by hard countdown limit ticks per round.
- Simultaneous claims on the same resource or position: Base coordinate 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 .
## State representation
- Persistent state:
- `grid_map`: binary matrix ( = open, = wall/cover).
- `agent_positions`: array of coordinates .
- `agent_headings`: array of orientation angles .
- `hider_status`: array of enums (`HIDING`, `RACING_TO_BASE`, `CAUGHT`, `SAVED`).
- `caught_queue`: FIFO list of caught agent IDs.
- `current_seeker_id`: integer .
- `current_tick`: integer .
- 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)`: with Manhattan norm .
- `set_heading(theta)`: orientation angle .
- `pong(target_id)`: Seeker action executed at Base .
- `save()` / `save_all()`: Hider action executed at Base .
## 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 JSONCite 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}
}