Formal Specification
The Map — Formal Specification
Jordan · hide-seek · Confidence: low
← Back to game pageImplementation Suitability
Suitability: engine-readyFidelity: discretizedGap-fills: 5
# Al-Kharitah — AI-optimized specification
## General idea
A strategic desert hide-and-seek game on a 2D grid featuring an asymmetric map-drawing and stealth-erasure mechanic. The Hiding team draws a stylized route map on a base tile and hides across grid nodes. The Seeking team decodes the map to navigate and capture hiders, while one designated stealth hider attempts to slip past searchers back to the base tile to erase the physical map before all hiders are discovered.
## Formal model
- **Abstraction taken:** The open sand terrain is discretized into an graph of nodes and obstacles. The sand map is modeled as a visible sub-graph of hints containing true and false trail edges.
- **Player/agent count:** 2 teams of 6 agents ( Hiders, Seekers).
- **Turn model:** Phased setup, followed by simultaneous real-time ticked movements.
## Formal rules
R1. **Setup & map drawing:** constructs a directed graph of hints at the baseline tile , containing actual hiding nodes and decoys.
R2. **Scatter phase:** agents position themselves on nodes . One agent is designated as .
R3. **Search & stealth ticks:** Each tick:
- Searchers move up to 1 unit on , observing agents within vision radius .
- Hiders remain stationary or make stealth moves (speed 1, high visibility risk if in Seeker line-of-sight).
- attempts to navigate back to .
R4. **Capture check:** If a seeker occupies the same node as a hider, that hider is captured.
R5. **Erasure trigger:** If reaches without being in the line of sight of any Seeker on the current tick, executes `erase_map()`.
R6. **Win conditions:**
- wins if `erase_map()` succeeds [gap-fill].
- wins if all hiders (or and hiders) are captured before map erasure [gap-fill].
R7. [gap-fill] Maximum duration:** Round caps at 100 ticks. If uncompleted, wins on timeout.
## Edge cases
- **Tie at the end condition:** Simultaneous erasure and capture on the same tick resolves in favor of the Seeker [gap-fill].
- **A player with no legal move:** Agent remains stationary (pass).
- **Repetition / cycles:** Bounded by the 100-tick limit [gap-fill].
- **Simultaneous claims:** Collision resolution gives capture priority to the Seeker on shared coordinates.
- **Player elimination mid-round:** Captured hiders enter spectator state without altering turn ticks.
- **Resource exhaustion:** Arena nodes are static.
- **Termination guarantee:** Provable termination via 100-tick cutoff.
## State representation
- **Persistent state:** `grid_dimensions: (M, N)`, `base_location: (0,0)`, `map_graph: SubGraph`, `map_erased: bool`.
- **Per-player state:** `position: (x,y)`, `role: Enum`, `captured: bool`.
- **Observable information:** Searchers observe their radius and the base map; Hiders observe their own .
## Action space
- `move(dx, dy)`: Bounded directional step.
- `erase_map()`: Available only to at .
- `pass()`: Stand still.
## Playability notes
- **Single-player-vs-AI:** Excellent suitability as a stealth-infiltration or guard-patrol puzzle.
- **Group games (n>4):** Naturally reduces to 1 Seeker vs 1 Infiltrator + 2 static decoy nodes.
- **Physical-skill games:** Physical sprinting abstracted to movement points per tick.
- **What is lost:** Real-world dune camouflage, footprint tracking, and physical sprint exhaustion.
## Implementation hints
Standard 2D grid pathfinding and line-of-sight raycasting. Map decoding can be implemented as edge-traversal weights.
Download as JSON
Download the full game corpus entry for this game as structured JSON.
Download JSONCite this page
The Map (Jordan). (n.d.). Games of Countries. https://gamesofcountries.com/games/jo-jordan/al-kharitah
@misc{gamesofcountries-jo-jordan-al-kharitah,
title = {The Map (Jordan)},
year = {n.d.},
publisher = {Games of Countries},
url = {https://gamesofcountries.com/games/jo-jordan/al-kharitah}
}