Skip to main content
Formal Specification

Ghummaye (Hide and Seek) — Formal Specification

Palestine · hide-seek · Confidence: low

← Back to game page

Implementation Suitability

Suitability: engine-readyFidelity: discretizedGap-fills: 5
# Al-Ghummaye — AI-optimized specification ## General idea A traditional hide-and-seek game on a 2D discrete grid with a home-base (*Mirsa'*) racing mechanic. A seeker closes eyes and counts at base while hiders conceal themselves. Hiders attempt to sneak out and tag the base to secure safety, while the seeker hunts them down by line-of-sight discovery and race-to-base tags. ## Formal model - **Abstraction taken:** Arena modeled as a 2D obstacle grid. Counting time modeled as an initial delay interval Tcount. Vision modeled via 2D line-of-sight raycasting. - **Player/agent count:** 3 to 10 agents (1 `Seeker`, N−1 `Hiders`). - **Turn model:** 1 Setup/Counting Phase, followed by real-time synchronized ticks. ## Formal rules R1. **Base:** Designated coordinate (0,0) as *Mirsa'* (Home Base). R2. **Counting phase:** Seeker remains frozen at (0,0) for Tcount=20 ticks while hiders move freely to hiding nodes H⊂G. R3. **Search & tag phase:** - Each tick, seeker and hiders move up to 1 unit. - Seeker line-of-sight check: If a hider is within distance D≤6 and unobstructed, seeker can call `spot_hider(hider_id)`. - Once spotted, a race ensues to (0,0): - If seeker reaches (0,0) first and calls `tag_out(hider_id)`, hider is captured. - If hider reaches (0,0) first and calls `safe()`, hider is safe. R4. **Sneak-in safety:** Any unspotted hider can navigate to (0,0) and execute `safe()` at any time without being spotted. R5. **Round resolution:** - If all hiders are captured, the first hider captured becomes the Seeker in the next round [gap-fill]. - If any hider executes a "Free All" (*Khalas*) trigger by reaching base before the seeker captures the last player, seeker must repeat the Seeker role [gap-fill]. R6. [gap-fill] Time cutoff:** Round terminates after 150 ticks. Remaining unfound hiders are declared safe. ## Edge cases - **Tie at the end condition:** If Seeker and Hider reach base on the same tick, tie resolves in favor of Hider (safe) [gap-fill]. - **A player with no legal move:** Agent remains stationary. - **Repetition / cycles:** Bounded by 150-tick limit [gap-fill]. - **Simultaneous claims:** Handled by base arrival order. - **Player elimination mid-round:** Captured hiders enter spectator queue. - **Resource exhaustion:** Arena grid is persistent. - **Termination guarantee:** Provable termination via 150-tick ceiling. ## State representation - **Persistent state:** `seeker_id: AgentID`, `first_captured: Optional[AgentID]`, `safe_count: int`. - **Ephemeral state:** `positions: Dict[AgentID, (x,y)]`, `spotted_status: Dict[AgentID, bool]`, `captured_status: Dict[AgentID, bool]`. - **Observable information:** Imperfect information (limited vision radius and obstacle occlusion). ## Action space - `move(dx, dy)`: Grid navigation. - `spot(hider_id)`: Seeker line-of-sight call. - `tag_base()`: Arrival action at (0,0). ## Playability notes - **Single-player-vs-AI:** High fun factor as stealth-infiltrator or patrol-guard AI. - **Group games (n>4):** Scales from 3 to 10 agents naturally. - **Physical-skill games:** Vision occlusion and sprinting mapped to line-of-sight math and grid ticks. - **What is lost:** Real physical hiding spots (e.g. behind olive trees, stone walls) and vocal counting rhythm. ## Implementation hints Standard 2D grid pathfinding with raycast line-of-sight checking.

Download as JSON

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

Download JSON
Cite this page

Ghummaye (Hide and Seek) (Palestine). (n.d.). Games of Countries. https://gamesofcountries.com/games/ps-palestine/ghummaye

@misc{gamesofcountries-ps-palestine-ghummaye,
  title = {Ghummaye (Hide and Seek) (Palestine)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/ps-palestine/ghummaye}
}