Skip to main content
Formal Specification

Hide and Seek (Greek Tag Base Variant) — Formal Specification

Greece · hide-seek · Confidence: low

← Back to game page

Implementation Suitability

Suitability: engine-readyFidelity: discretizedGap-fills: 2
# Kryfto — AI-optimized specification ## General idea An asymmetric, imperfect-information pursuit and stealth game on a 2D grid with line-of-sight obstacles and a central home base. A single seeker searches for hidden agents, who attempt to either stay concealed or execute a dash to the base before the seeker can return and tag 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 (W×H) with static obstacle blocks (walls, foliage). Vision modeled as 2D raycasting up to a maximum sight range. Time advances in discrete simultaneous ticks. - **Player/agent count:** 1 Seeker agent (S) vs K Hider agents (H1..HK, default K=4). - **Turn model:** Simultaneous tick-based execution. ## Formal rules R1. Setup & Invariant Base: - Base cell defined at (xbase,ybase). - Phase 1 (Countdown, ticks 0..Tcount): Seeker agent S is locked at base cell with vision set to 0. Hider agents move freely to choose hiding positions. - Phase 2 (Active Search, tick Tcount+1 onward): Seeker explores the grid. R2. Vision & Spotting: - Line-of-sight is computed via Bresenham raycasting. - If Seeker S has unobstructed line-of-sight to Hider Hi within radius Rvision: Hi becomes "spotted" (`spotted[i] = True`). R3. Base Race Resolution: - Once spotted, both S and Hi race toward the base cell (xbase,ybase). - If Seeker S reaches base first and executes `tag_base(i)`: Hi is `captured` (`status[i] = captured`). - If Hider Hi reaches base first and executes `tag_self()`: Hi is `safe` (`status[i] = safe`). R4. Universal Rescue Rule: - If exactly one hider Hlast remains in `hidden` or `spotted` status (all other hiders are either `safe` or `captured`): - If Hlast reaches base and executes `universal_rescue()`: ALL previously `captured` agents transition to `safe`. Seeker S receives 0 points and must repeat as seeker in round 2. R5. Round Resolution & Next Seeker: - If Hlast is captured or enters `safe` via `tag_self()`, the round ends. - If ≥1 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 S and Hider Hi 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 (Tmax=300). ## State representation - Persistent state: - `grid`: 2D occupancy map (empty, obstacle, base). - `seeker`: `[x, y, target_hider]`. - `hiders`: Array of K 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. - `tag_base(target_id)`: Executable by seeker when at base to capture spotted hider. - `tag_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 noise and 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 pitch cues. ## 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. - Branching factor: 5 actions per active agent per tick.

Download as JSON

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

Download JSON
Cite this page

Hide and Seek (Greek Tag Base Variant) (Greece). (n.d.). Games of Countries. https://gamesofcountries.com/games/gr-greece/kryfto

@misc{gamesofcountries-gr-greece-kryfto,
  title = {Hide and Seek (Greek Tag Base Variant) (Greece)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/gr-greece/kryfto}
}