Skip to main content
Formal Specification

Ghanaian Traditional Stick-Hiding Race — Formal Specification

Ghana · hide-seek · Confidence: low

← Back to game page

Implementation Suitability

Suitability: engine-readyFidelity: discretizedGap-fills: 2
# Pilolo — AI-optimized specification ## General idea A two-phase search and sprint game where seekers explore a 2D environment to discover hidden tokens and race to a finish boundary. ## Formal model - Continuous 2D bounded environment `[0, 20] x [0, 20]` with finish line at `y = 0`. - Phase 1: Leader assigns token locations `T_i = (x_i, y_i)`. - Phase 2: Seekers start at `(x, 0)` and move with speed `v <= 3.0 m/s`. - Discovery radius `r = 1.0 m`. Upon entering discovery radius, seeker collects token. - Sprint: Once token is collected, seeker sprints to `y = 0`. ## Formal rules R1. Round initialization: Leader places `K` tokens within bounds. R2. Seeker exploration: Each tick `dt = 0.1s`, seeker updates position. R3. Discovery: When `dist(seeker_pos, token_pos) <= 1.0`, token acquired. [gap-fill] R4. Sprint: Seeker moves toward base line `y = 0`. R5. Win condition: First seeker with token to cross `y <= 0` wins the round (+1 point). [gap-fill] ## Edge cases 1. Tie at finish line: Earliest timestamp wins; if identical tick, split point. 2. No legal move: Seeker out of bounds clamped to boundary. 3. Repetition/cycles: Max search time 300 ticks (30s); round ends in draw if unrecovered. 4. Simultaneous claims: Each token is unique to the first finder within radius. 5. Elimination: No player elimination; round-robin points. 6. Resource exhaustion: Exactly `K` tokens available per round. 7. Termination: Maximum 10 rounds; guaranteed finite termination. ## State representation - `seeker_positions: Array[K] of Vector2D`. - `token_positions: Array[K] of Vector2D`. - `token_collected: Array[K] of bool`. - `scores: Array[K] of int`. ## Action space - `search_move(target_direction: Vector2D, speed: float)`. - `grab_token(token_id: int)`. - `sprint_base()`. ## Playability notes Easily simulable as a grid or continuous pathfinding competition. ## Implementation hints Use spatial partitioning (grid cells) for efficient `dist()` queries between seekers and tokens.

Download as JSON

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

Download JSON
Cite this page

Pilolo (Ghana). (n.d.). Games of Countries. https://gamesofcountries.com/games/gh-ghana/pilolo

@misc{gamesofcountries-gh-ghana-pilolo,
  title = {Pilolo (Ghana)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/gh-ghana/pilolo}
}