Formal Specification
Hide and Seek (Romanian Base-Tapping Variant) — Formal Specification
Romania · hide-seek · Confidence: high
← Back to game pageImplementation Suitability
Suitability: engine-readyFidelity: discretizedGap-fills: 2
# De-a v-ați ascunselea — AI-optimized specification
## General idea
An asymmetric, imperfect-information pursuit and stealth game on a 2D grid with obstacle blocks and a central home base. A single seeker searches for hidden agents, who attempt to either stay concealed or execute a sprint to the base before the seeker can return and tap it. The final active hider possesses the capability to execute a game-resetting "universal rescue" by reaching the base.
## Formal model
- **Abstraction taken:** Environment discretized into a 2D grid () with static obstacle blocks. Vision modeled as 2D raycasting up to a maximum sight range. Time advances in discrete simultaneous ticks.
- **Player/agent count:** 1 Seeker agent () vs Hider agents (, default ).
- **Turn model:** Simultaneous tick-based execution.
## Formal rules
R1. Setup & Base:
- Base coordinate .
- Countdown Phase (ticks ): Seeker locked at base with vision 0. Hiders navigate freely to chosen hiding cells.
- Search Phase (tick onward): Seeker explores the environment.
R2. Vision & Spotting:
- Computed via Bresenham line-of-sight raycasting.
- If Seeker has clear line-of-sight to Hider within radius : becomes "spotted" (`spotted[i] = True`).
R3. Base Race Resolution:
- Once spotted, both and race toward the base cell .
- If Seeker reaches base first and executes `tap_base(i)`: is `captured` (`status[i] = captured`).
- If Hider reaches base first and executes `tap_self()`: is `safe` (`status[i] = safe`).
R4. Universal Rescue Rule:
- If exactly one hider remains in `hidden` or `spotted` status (all other hiders are either `safe` or `captured`):
- If reaches base and executes `universal_rescue()`: ALL previously `captured` agents transition to `safe`. Seeker receives 0 points and repeats as seeker in round 2.
R5. Round Resolution & Next Seeker:
- If is captured or enters `safe` via `tap_self()`, the round ends.
- If hider was captured without universal rescue, the first captured hider becomes the Seeker for the subsequent round.
R6. [gap-fill] Turn Limit: Search phase has a hard limit of 300 ticks. Any hider still hidden at tick 300 automatically transitions to `safe`.
## Edge cases
- Tie at the end condition: If Seeker and Hider arrive at the base cell on the exact same tick, [gap-fill] the hider is awarded priority (`safe`), reflecting traditional street rules favoring the runner.
- A player with no legal move: Waiting / staying in place is always legal.
- Repetition / cycles: Bounded by the strict 300-tick round timer (R6).
- Simultaneous claims on the same resource or position: Handled by deterministic priority (hider safe on tie arrival).
- Player elimination mid-round; turn order repair: Captured or saved agents are removed from active grid movement, and the environment continues seamlessly.
- Resource exhaustion: Not applicable — no consumable resources.
- Termination guarantee: Enforced by finite tick limit ().
## State representation
- Persistent state:
- `grid`: 2D occupancy map (empty, obstacle, base).
- `seeker`: `[x, y, target_hider]`.
- `hiders`: Array of structs: `[x, y, status, capture_order]`.
- `tick`: Integer counter.
- Per-tick ephemeral state:
- `visible_agents`: List of hiders currently in seeker's line-of-sight.
- Observable information: Imperfect information. Seeker observes only visible cells and base status. Hiders observe their own local vision and seeker position when within line-of-sight.
## Action space
- `move(direction)`: Cardinal direction or stay.
- `tap_base(target_id)`: Executable by seeker when at base to capture spotted hider.
- `tap_self()`: Executable by hider when at base.
- `universal_rescue()`: Executable by last remaining hider at base.
## Playability notes
- Single-player-vs-AI: Highly compelling stealth/pursuit game. Human can play either as Seeker (investigating sightlines) or as Hider (timing stealth breakout dashes).
- Group games (n>4): Reduces to 1 Seeker vs 2 Hiders while preserving full strategic tension and the dramatic universal rescue mechanic.
- Physical-skill games: Physical foot-speed and stealth abstracted into grid speed (cells per tick) and line-of-sight geometry.
- What is lost: Three-dimensional physical hiding (climbing trees, squeezing behind crates) and vocal shouting.
## Implementation hints
- Implement standard 2D grid with Bresenham raycasting for field-of-view.
- Maintain a FIFO capture queue to record `first_captured` accurately for R5.
Download as JSON
Download the full game corpus entry for this game as structured JSON.
Download JSONCite this page
Hide and Seek (Romanian Base-Tapping Variant) (Romania). (n.d.). Games of Countries. https://gamesofcountries.com/games/ro-romania/de-a-v-ati-ascunselea
@misc{gamesofcountries-ro-romania-de-a-v-ati-ascunselea,
title = {Hide and Seek (Romanian Base-Tapping Variant) (Romania)},
year = {n.d.},
publisher = {Games of Countries},
url = {https://gamesofcountries.com/games/ro-romania/de-a-v-ati-ascunselea}
}