Skip to main content
Formal Specification

Maltese Hide and Seek — Formal Specification

Malta · hide-seek · Confidence: low

← Back to game page

Implementation Suitability

Suitability: engine-readyFidelity: discretizedGap-fills: 3
# Noli (Kaċċamendula) — AI-optimized specification ## General idea A discretized hide-and-seek game on a 2D topological visibility graph with a designated home base (*l-omm*). The Seeker explores the environment to establish line-of-sight on hidden agents, triggering a simultaneous sprint race to base to record a capture or secure immunity. ## Formal model - **Abstraction taken:** The urban maze of alleys is discretized into an undirected graph `G = (V, E)` with occluding walls that block line-of-sight (LOS). Home base is vertex `v_base in V`. Movement is turn-based step traversal across vertices. - **Player/agent count:** 1 Seeker and N Hiders (default N = 4). - **Turn model:** Two phases: (1) Initial hiding phase (Hiders move while Seeker immobilized), (2) Active search & race phase (synchronous movement ticks). ## Formal rules R1. Setup: Home base `v_base` is established. Seeker is positioned at `v_base`. R2. Phase 1 (Hiding): R2.1. Seeker remains locked at `v_base` for `T_hide = 10` ticks. R2.2. Hiders traverse graph vertices up to 10 steps to reach hiding nodes with low visibility from `v_base`. R3. Phase 2 (Search & Base Race): R3.1. On each tick `t`, all agents choose an adjacent vertex: `move(v_next)`. R3.2. LOS Check: If an unobstructed line-of-sight exists between Seeker `v_seeker` and an active Hider `v_hider`, the Hider is `SPOTTED`. R3.3. Once spotted, both Seeker and Hider must sprint toward `v_base`. R3.4. If Seeker reaches `v_base` before Hider: Hider is `CAPTURED` (`captured[i] = true`). R3.5. If Hider reaches `v_base` before Seeker: Hider is `SAFE` (`safe[i] = true`). R3.6. [gap-fill] Stealth Home Run (*Salva l-kollha*): If an unspotted Hider reaches `v_base` while Seeker is absent, they execute `save_all()`, releasing all currently captured hiders to `SAFE` status. R4. Game ends when all Hiders are either `CAPTURED` or `SAFE`. R5. [gap-fill] Scoring: Seeker scores 1 point per captured Hider; Hiders score 1 point per safe escape. ## Edge cases - Tie at the end condition: If Seeker and Hider reach `v_base` on the exact same tick, Hider is declared `SAFE` (favoring the runner). - A player with no legal move: Graph vertices always contain at least one adjacent edge or self-loop. - Repetition / cycles: Bounded by a max-search watchdog limit of 150 ticks [gap-fill]; unreached hiders are declared `SAFE` at time expiry. - Simultaneous claims on the same resource or position: Multiple agents may occupy the same graph vertex. - Player elimination mid-round: Captured hiders are removed from the active graph. - Resource exhaustion: Not applicable. - Termination guarantee: Guaranteed by the 150-tick watchdog limit. ## State representation - Persistent state: `graph_topology` `(V, E, obstacles)`, `scores` (map agent_id -> int). - Per-tick ephemeral state: `seeker_pos` (vertex_id), `hider_states` (map agent_id -> struct { `pos`, `status: HIDDEN / SPOTTED / SAFE / CAPTURED` }), `tick_count` (int). - Observable information: Partially observable — Seeker only observes nodes within direct line-of-sight; Hiders observe nodes within their individual LOS. ## Action space - `move_to_vertex(node_id)`: Traversal to adjacent graph vertex. - `save_all()`: Available exclusively to unspotted hiders at `v_base`. ## Playability notes - Single-player-vs-AI: Natural — human player acts as Seeker searching the graph or as Hider executing stealth routes against AI patrol routes. - Group games (n>4): Multi-agent hide-and-seek benchmark with partial observability. - Physical-skill games: Stealth footsteps and sprinting speed abstracted into graph edge weights. - What is lost: The tension of holding one's breath behind a sun-warmed stone parapet. ## Implementation hints Graph pathfinding with raycast LOS checking. Suggested milestone: Verify that line-of-sight properly switches an agent from `HIDDEN` to `SPOTTED` state.

Download as JSON

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

Download JSON
Cite this page

Maltese Hide and Seek (Malta). (n.d.). Games of Countries. https://gamesofcountries.com/games/mt-malta/noli-kaccamendula

@misc{gamesofcountries-mt-malta-noli-kaccamendula,
  title = {Maltese Hide and Seek (Malta)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/mt-malta/noli-kaccamendula}
}