Skip to main content
Formal Specification

Hide and Seek with Base Tagging — Formal Specification

Croatia · hide-seek · Confidence: low

← Back to game page

Implementation Suitability

Suitability: engine-readyFidelity: discretizedGap-fills: 2
# Skrivača — AI-optimized specification ## General idea A partial-information spatial stealth and pursuit game on a 2D grid containing obstacles and a central home base. Hider agents conceal their positions and attempt to sprint to the base before a searching seeker agent spots them and completes a base-tagging action. ## Formal model - **Abstraction taken:** The 2D outdoor arena is discretized into a W×H grid (20×20 cells) containing obstacle cells 𝒪 that block line-of-sight (LOS). Home Base is at (0,0). Visibility is computed via Bresenham raycasting. Movements occur via discrete time ticks (Δt=1.0 s). - **Player/agent count:** N agents (Aseek,A1…AN−1, with N∈[3,10], standard N=5). - **Turn model:** Two phases: (1) Concealment Phase (Tcount=20 ticks), (2) Search and Base Sprint Phase (T≤120 ticks). ## Formal rules R1. Concealment Setup: - Base located at (0,0). Seeker stationary at (0,0) with vision blocked during t∈[0,Tcount]. - Hiders move to hide behind obstacles in 𝒪. R2. Line of Sight & Spotting: - At t>Tcount, Seeker navigates grid. - Seeker spots hider Ai if LOS(pos(Aseek),pos(Ai))==True and ‖pos(Aseek)−pos(Ai)‖≤Rvis (where Rvis=8.0 cells). - When spotted, a race to Base (0,0) begins between Aseek and Ai. R3. Base Sprint and Tag Resolution: - Arrival times to Base (0,0): - tseek=‖pos(Aseek)−(0,0)‖vseek+τspot. - thide=‖pos(Ai)−(0,0)‖vhide+τreact. - If tseek<thide: Seeker strikes base; Ai is CAPTURED (status(Ai)←CAPTURED). - If thide≤tseek: Hider strikes base; Ai is SAFE (status(Ai)←SAVED). R4. Universal Rescue (*Spas za sve*): - If the last surviving unspotted hider Alast reaches Base (0,0) undetected and executes `strike_base(ALL)`: - All captured hiders are reset to status←SAVED. - Seeker Aseek is forced to seek again in the next round. R5. Next Round Seeker Selection: - If universal rescue did NOT occur: The first captured hider becomes the new Seeker for the subsequent round. - [gap-fill] Match terminates after M=6 rounds. The agent with the fewest rounds spent as Seeker wins. ## Edge cases - Tie at the end condition: Tied seeker durations result in a shared victory. - A player with no legal move: Non-colliding grid steps in cardinal directions are always available. - Repetition / cycles: [gap-fill] Search phase hard cap Tmax=120 ticks; remaining unspotted hiders are automatically declared SAVED. - Simultaneous claims on the same resource or position: Base tags resolve strictly by arrival timestamp (tseek vs thide). - Player elimination mid-round; turn order repair: If an agent disconnects, agent is removed from active candidate list. - Resource exhaustion: Grid and obstacle geography invariant across rounds. - Termination guarantee: Strict termination guaranteed by finite tick cap Tmax=120 per round and M=6 round cap. ## State representation - Persistent state: `seeker_id: int`, `round_index: int`, `seeker_durations: dict[int, int]`. - Ephemeral round state: `agent_positions: dict[int, tuple[int, int]]`, `agent_statuses: dict[int, enum[HIDDEN, SPOTTED, CAPTURED, SAVED]]`, `first_captured_id: Optional[int]`, `tick: int`. - Observable information: Hiders observe base and seeker location; Seeker observes ONLY cells within raycasted line of sight. ## Action space - `move(dx: int, dy: int)`: Cardinal grid displacement (‖(dx,dy)‖≤1). - `sprint_to_base()`: High-speed trajectory toward (0,0). ## Playability notes - Single-player-vs-AI: Highly engaging; human plays as seeker exploring partial-information map or as hider planning stealth routes. - Group games (n>4): Natively designed for 4 to 10 agents. - Physical-skill games: Sprint speeds and reaction latencies parameterized per agent. - What is lost: Heart-pounding physical stillness in dark hiding spots, autumn foliage smell. ## Implementation hints Grid-based partially observable 2D stealth environment with raycasting FOV (field of view). First milestone: implement 1 seeker vs 2 hiders with A* pathfinding and line-of-sight checks.

Download as JSON

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

Download JSON
Cite this page

Hide and Seek with Base Tagging (Croatia). (n.d.). Games of Countries. https://gamesofcountries.com/games/hr-croatia/skrivaca

@misc{gamesofcountries-hr-croatia-skrivaca,
  title = {Hide and Seek with Base Tagging (Croatia)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/hr-croatia/skrivaca}
}