Skip to main content
Formal Specification

The Snatch — Formal Specification

Jordan · chase-tag · Confidence: low

← Back to game page

Implementation Suitability

Suitability: engine-readyFidelity: discretizedGap-fills: 6
# Al-Khatfah — AI-optimized specification ## General idea An asymmetric raid-and-chase tag game on a 2D plane. Defenders are stationed inside a circular fort zone while attackers circle the exterior. An attacker enters the fort, tags (snatches) a defender, and must sprint back across a designated safe boundary (*Al-Madd*) before defenders can chase and tag them. ## Formal model - **Abstraction taken:** Continuous physical running and dodging discretized into a 2D coordinate grid with discrete speed points per tick. - **Player/agent count:** 2 teams of N players (N∈[4,8]). - **Turn model:** Real-time synchronized state ticks (e.g. 100ms per tick). ## Formal rules R1. **Zones:** The arena features a Fort Zone Zfort (circle radius R) centered at (0,0), and a Safe Line Lsafe at x=Dsafe. R2. **Defenders' constraint:** Defenders must remain inside Zfort until a "snatch" event occurs. R3. **The Snatch:** An active attacker enters Zfort and executes `snatch(defender_id)` upon reaching an adjacent grid cell. R4. **The Chase:** Upon a successful snatch, all defenders become unconstrained and can move anywhere to intercept the fleeing attacker. The attacker moves toward Lsafe. R5. **Resolution:** - If the attacker crosses Lsafe before being tagged: Attacking team scores 1 point [gap-fill]. - If a defender reaches the attacker's cell before Lsafe: Attacker is tagged and eliminated for the round [gap-fill]. R6. [gap-fill] Role swap:** After all attackers have had 1 raid attempt, or after 3 eliminations, teams swap roles. R7. [gap-fill] Round limit:** Each raid attempt has a maximum time limit of 50 ticks to reach safety or be tagged. ## Edge cases - **Tie at the end condition:** Point comparison after equal attacking innings. - **A player with no legal move:** Standard directional movement always possible unless tagged. - **Repetition / cycles:** Bounded by 50-tick limit per raid [gap-fill]. - **Simultaneous claims:** If tag occurs on the exact tick the attacker reaches Lsafe, tie resolves to the runner (safe) [gap-fill]. - **Player elimination mid-round:** Eliminated agents remain in spectator buffer until inning swap. - **Resource exhaustion:** Arena coordinates are static. - **Termination guarantee:** Provable termination via per-raid tick limit and fixed inning count. ## State representation - **Persistent state:** `scores: Dict[Team, int]`, `active_roles: Dict[Team, Role]`, `raids_completed: int`. - **Ephemeral state:** `positions: Dict[AgentID, (x,y)]`, `snatched_flag: bool`, `active_raider: AgentID`, `tick_counter: int`. - **Observable information:** Fully observable to all agents. ## Action space - `move(dx, dy)`: Unit directional vector. - `snatch(target_id)`: Valid when adjacent inside Zfort. - `tag(target_id)`: Valid when adjacent to raider outside Zfort. ## Playability notes - **Single-player-vs-AI:** Natural adaptation as a pursuit/evasion AI benchmark. - **Group games (n>4):** Reduces to 1 Raider vs 2 Defenders with proportional speed balancing. - **Physical-skill games:** Speed differential modeled via movement points per tick. - **What is lost:** Physical body feints, sudden direction shifts, and tackling impacts. ## Implementation hints Grid-based pathfinding with standard pursuit/evasion algorithms (e.g. potential fields or A*).

Download as JSON

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

Download JSON
Cite this page

The Snatch (Jordan). (n.d.). Games of Countries. https://gamesofcountries.com/games/jo-jordan/al-khatfah

@misc{gamesofcountries-jo-jordan-al-khatfah,
  title = {The Snatch (Jordan)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/jo-jordan/al-khatfah}
}