Skip to main content
Formal Specification

Syrian Heights Tag — Formal Specification

Syria · chase-tag · Confidence: medium

← Back to game page

Implementation Suitability

Suitability: adaptation-requiredFidelity: discretizedGap-fills: 3
# Aali Wati — AI-optimized specification ## General idea A spatial chase-and-tag game discretized on a 2D node map containing "high" and "low" nodes. Runner agents exploit elevated nodes to gain safety from the chaser agent, but anti-camping rules force runners to constantly descend and navigate the low-height hazard zone. ## Formal model - **Abstraction taken:** The urban environment is discretized into a 2D grid graph. Each node (x,y) has a property H∈{0,1} representing its elevation level (0=wati, 1=aali). - **Player/agent count:** 1 chaser agent, 2 to 14 runner agents. - **Turn model:** Real-time ticked (simultaneous movement per tick). ## Formal rules R1. Setup: A grid of size X×Y. A subset of nodes A⊂{(x,y)} are designated "high" (H=1). All other nodes are "low" (H=0). R2. Speed: - The chaser moves at a rate of 2 nodes per tick. - Runners move at a rate of 1 node per tick. - [gap-fill: speed differential to represent physical chasing balance]. R3. Movement Loop: Every tick, all agents simultaneously submit a movement vector indicating their target node. If the movement is valid (adjacent node and not blocked by walls), their coordinate is updated. R4. Safety State: 4.1. If a runner is standing on a node (x,y)∈A (high), they are `safe`. 4.2. If a runner is standing on a node (x,y)∉A (low), they are `vulnerable`. R5. [gap-fill] Anti-Camping Counter: 5.1. Every runner has a persistent integer counter `ticks_on_high`, initialized to 0. 5.2. If a runner spends a tick on a high node, `ticks_on_high` increases by 1. 5.3. If `ticks_on_high` exceeds 5, their state is set to `vulnerable` even if they remain on a high node. 5.4. If the runner moves to a low node (H=0), `ticks_on_high` resets to 0. R6. Tagging: 6.1. At the end of a tick, if the chaser's position is identical to, or immediately adjacent to, any `vulnerable` runner's position, a tag occurs. 6.2. Roles swap instantly. The tagged runner becomes the new chaser. The old chaser becomes a runner. 6.3. [gap-fill] To prevent instant tag-backs, the newly designated chaser is frozen at their position for 3 ticks, allowing other runners to scatter. R7. Win / Loss / Draw: 7.1. Active round-based play. The game ends after a maximum limit of T=1000 ticks. 7.2. Each player accumulates a penalty score equal to the total number of ticks they spent as the chaser. The player with the lowest penalty score wins. ## Edge cases - Tie at the end condition: If multiple players have the same lowest chaser-tick count, they share the victory. - A player with no legal move: Not applicable; agents can always choose to stay or move to any unblocked adjacent cell. - Repetition / cycles: Bounded by the absolute game tick limit T, guaranteeing termination. - Simultaneous claims on the same resource: If multiple runners attempt to move into the exact same high node, only one is permitted (lowest agent ID has priority), and the others are deflected to their previous nodes, preventing clustering on a single platform. - Player elimination mid-round: Not applicable; no player is eliminated. - Resource exhaustion: None. - Termination guarantee: Guaranteed by the maximum tick limit T. ## State representation - Persistent state: Grid coordinates, set of high nodes A, positions of all agents, agent roles (chaser/runner), `ticks_on_high` counters, freeze counters, cumulative chaser-ticks per player, current tick. - Per-tick ephemeral state: Declared movement actions. - Observable information: Fully observed by all agents (all positions and elevations are public knowledge). ## Action space - `move(dx, dy)`: Moves to an adjacent grid node (x+dx,y+dy) where dx,dy∈{−1,0,1}. ## Playability notes - Single-player-vs-AI: Excellent. AI runners can use potential-field pathfinding to stay away from the chaser while seeking out the nearest high nodes. AI chaser uses A* pathfinding to target the closest vulnerable runner. - Group games (n>4): Natively supported. The simultaneous movement engine scales efficiently. - Physical-skill games: Physical climbing speed and stamina are modeled by the node speed rates and the anti-camping tick limits. - What is lost: The raw athletic agility, the physical touch of tag, and the spatial parkour of climbing real walls and curbs. ## Implementation hints - Implement on a simple grid graph using a 2D array. Use BFS to calculate distances for AI pathfinding. - First milestone: Create the grid with high nodes, implement simultaneous movement, and verify the safe/vulnerable state toggling and anti-camping counter.

Download as JSON

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

Download JSON
Cite this page

Syrian Heights Tag (Syria). (n.d.). Games of Countries. https://gamesofcountries.com/games/sy-syria/aali-wati

@misc{gamesofcountries-sy-syria-aali-wati,
  title = {Syrian Heights Tag (Syria)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/sy-syria/aali-wati}
}