Skip to main content
Formal Specification

Korkaat (Sudanese Hide and Seek) — Formal Specification

Sudan · hide-seek · Confidence: medium

← Back to game page

Implementation Suitability

Suitability: engine-readyFidelity: discretizedGap-fills: 2
# Korkaat — AI-optimized specification ## General idea A stealth evasion and race game on a discrete spatial graph. A Seeker agent explores graph nodes to acquire visual line-of-sight on hidden Hider agents, triggering a sprint race to the home base node where the Seeker attempts to tag the base first to eliminate the Hider, while Hiders attempt to sneak onto the base to achieve safety. ## Formal model - **Abstraction taken:** Compound and alley topography is discretized into a planar visibility graph G=(V,E) with a designated Home Base node vbase. Hiding spots are leaf nodes with low visibility occlusion coefficients. - **Player/agent count:** 1 Seeker agent vs. K Hider agents (standard 2-agent formalization: 1 Seeker vs. 1 Hider). - **Turn model:** Real-time ticked / simultaneous discrete movement steps per tick. ## Formal rules R1. Setup: G=(V,E) has N nodes. Seeker starts at vbase. Hiders have a 10-tick head start during which Seeker state is `COUNTING` (cannot move or observe nodes outside vbase). Hiders move to initial hiding nodes. R2. Movement per tick: - Seeker speed: 2 node steps per tick. - Hider speed: 1 node step per tick. R3. Vision & Detection: - Seeker has a vision cone / line-of-sight radius of 2 hops in graph G unobstructed by occluding obstacle nodes. - If a Hider is within unobstructed sight, the Hider's status becomes `SPOTTED`. R4. Base Race Resolution: - Once spotted, both agents commit to path targets. If the Seeker reaches vbase before or at the same tick as the Hider, and calls `tag_base(hider_id)`, the Hider is `CAPTURED`. - If the Hider reaches vbase without being tagged, the Hider calls `touch_base()` and becomes `SAFE`. R5. [gap-fill] Mass Rescue Rule: In multi-agent play (K>1), if the final free Hider reaches vbase safely, all `CAPTURED` agents become `FREE` and return to the game; Seeker receives −50 points. R6. [gap-fill] Search Time Limit: The round ends after a maximum of 100 ticks. Any Hiders neither captured nor saved at tick 100 are automatically declared `SAFE`. R7. Win condition: Seeker wins if all Hiders are `CAPTURED`. Hider team wins if ≥1 Hider becomes `SAFE`. ## Edge cases - Tie at the end condition: Simultaneous arrival at vbase gives priority to the Seeker (Seeker captures on tie). - A player with no legal move: Nodes have ≥2 degree; staying in place (`WAIT`) is always legal. - Repetition / cycles: Bounded by the 100-tick hard round limit (R6). - Simultaneous claims on the same resource or position: Handled by R4/R5 deterministic priority rules at vbase. - Player elimination mid-round; turn order repair: Captured hiders enter the inactive pool; remaining active hiders continue movement simultaneously. - Resource exhaustion (pieces, tokens, space, time): Ticks expire at 100; node graph is fixed. - Termination guarantee: Guaranteed by the hard 100-tick cutoff. ## State representation - Persistent state: - `graph`: adjacency list and occlusion properties. - `seeker_position`: node vS∈V. - `hider_states`: map of `hider_id` to `{position: Node, status: HIDDEN | SPOTTED | CAPTURED | SAFE}`. - `current_tick`: integer in `0..100`. - Ephemeral state: `visibility_mask`: nodes currently visible to Seeker. - Observable information: Hiders observe Seeker position if within line-of-sight; Seeker observes only nodes in active vision cone (partial observability). ## Action space - Seeker: `move(path)` (length ≤2), `tag_base(hider_id)`. - Hider: `move(path)` (length ≤1), `touch_base()`, `wait()`. ## Playability notes - Single-player-vs-AI: Natural fit for 1 human Seeker vs AI Hiders, or human Hider vs AI Seeker. - Group games (n>4): Cleanly reduces to 1 Seeker vs 1 Hider in a 2-agent duel, preserving the core stealth-and-dash dynamic. - Physical-skill games: Running speed and agility modeled as graph path traversal speeds. - What is lost in adaptation: Physical contortion into tight spaces and ambient auditory cues are simplified to visibility ranges. ## Implementation hints Graph-based discrete pursuit-evasion model. Standard Dijkstra or A* pathfinding handles agent navigation. First milestone: implement 2D grid graph with line-of-sight raycasting and base race logic.

Download as JSON

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

Download JSON
Cite this page

Korkaat (Sudanese Hide and Seek) (Sudan). (n.d.). Games of Countries. https://gamesofcountries.com/games/sd-sudan/korkaat

@misc{gamesofcountries-sd-sudan-korkaat,
  title = {Korkaat (Sudanese Hide and Seek) (Sudan)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/sd-sudan/korkaat}
}