Formal Specification
Azim Sar (Azim Lah) — Formal Specification
Jordan · hide-seek · Confidence: low
← Back to game pageImplementation Suitability
Suitability: engine-readyFidelity: discretizedGap-fills: 7
# Azim Sar — AI-optimized specification
## General idea
A nocturnal desert search-and-escort game. A white bone is thrown into a dark 2D grid arena. Both teams scatter to discover it. The finder secretly secures the bone and attempts to navigate back across a baseline (*Al-Madd*) while teammates block opposing pursuers attempting to tackle and force a turnover.
## Formal model
- **Abstraction taken:** Moonlight visibility and sensory search in darkness are modeled through limited vision radii and probabilistic cell discovery checks. Desert sprinting and tackling are modeled on a 2D discrete grid.
- **Player/agent count:** 2 teams () with agents each ().
- **Turn model:** 1 Initial Throw Phase, followed by simultaneous real-time state ticks.
## Formal rules
R1. **Throw phase:** Bone is projected to a random coordinate on the arena grid .
R2. **Search phase:** All agents start at baseline and navigate the grid.
- Each tick an agent moves up to 1 cell.
- If agent is within distance of , discovery probability [gap-fill].
R3. **Possession & concealment:**
- Upon discovery, agent becomes . The bone position updates to match .
- [gap-fill] Carrier identity is hidden from opponents until carrier enters within line-of-sight distance of an opponent or sprints at full speed.
R4. **Passing & tackling:**
- can execute `pass_bone(teammate_id)` if teammate is within range 3.
- If an opponent occupies the same cell as , a tackle occurs, forcing a turnover [gap-fill].
R5. **Scoring:**
- If an agent carrying the bone crosses (the baseline), their team scores 1 point and wins the round.
R6. [gap-fill] Round limit:** If neither team scores within 150 ticks, the round ends in a draw and resets.
## Edge cases
- **Tie at the end condition:** First team to achieve 3 round points wins the match [gap-fill].
- **A player with no legal move:** Agent remains stationary or takes any free adjacent grid step.
- **Repetition / cycles:** Bounded by 150-tick round cap [gap-fill].
- **Simultaneous claims:** If two opposing agents discover the bone on the same tick, possession resolves by higher agility attribute [gap-fill].
- **Player elimination mid-round:** Not applicable (no eliminations; tackle triggers turnover).
- **Resource exhaustion:** 1 bone item, immutable.
- **Termination guarantee:** Guaranteed by 150-tick round ceiling and 3-point victory threshold.
## State representation
- **Persistent state:** `scores: Dict[Team, int]`, `round_count: int`.
- **Ephemeral state:** `bone_location: (x,y)`, `carrier_id: Optional[AgentID]`, `agent_positions: Dict[AgentID, (x,y)]`, `carrier_revealed: bool`.
- **Observable information:** Imperfect information — bone location is unknown until discovered; carrier identity is hidden until spotted.
## Action space
- `move(dx, dy)`: Step on grid.
- `search()`: Increases discovery radius.
- `pass_bone(target_id)`: Available to carrier.
- `tackle(target_id)`: Available to opponent on adjacent cell.
## Playability notes
- **Single-player-vs-AI:** Operates as a dynamic stealth/rugby simulation in darkness.
- **Group games (n>4):** Reduces to 2v2 with proportional arena grid dimensions.
- **Physical-skill games:** Desert sprinting and night vision mapped to grid velocity and perception radii.
- **What is lost:** Real tactile sand-searching with bare feet and physical body collisions.
## Implementation hints
Standard grid game with fog-of-war / hidden identity mechanics.
Download as JSON
Download the full game corpus entry for this game as structured JSON.
Download JSONCite this page
Azim Sar (Azim Lah) (Jordan). (n.d.). Games of Countries. https://gamesofcountries.com/games/jo-jordan/azim-sar
@misc{gamesofcountries-jo-jordan-azim-sar,
title = {Azim Sar (Azim Lah) (Jordan)},
year = {n.d.},
publisher = {Games of Countries},
url = {https://gamesofcountries.com/games/jo-jordan/azim-sar}
}