Skip to main content
Formal Specification

Grid Line Evasion / Tag — Formal Specification

Philippines · chase-tag · Confidence: low

← Back to game page

Implementation Suitability

Suitability: engine-readyFidelity: discretizedGap-fills: 3
# Patintero — AI-optimized specification ## General idea A simultaneous-tick team territory evasion game on a 2D discrete grid representation of a 6-box court (10m x 6m). Attackers start behind line Y=0 and attempt to penetrate to Y=20 and return to Y=0 without being tagged by 5 defenders constrained to 1D linear track manifolds (4 horizontal lines + 1 central vertical spine). Any valid tag on an attacker triggers an immediate role swap or round turnover. ## Formal model - **Abstraction taken:** Court space is discretized into a 2D integer grid of dimensions X∈[0..12],Y∈[0..20] (0.5m resolution). Defenders D1..D4 are strictly constrained to transverse 1D lines Y∈{0,6,13,20}; defender D0 (captain) can move along Y=0 and the central vertical line X=6. Attackers A0..A4 move freely across the open 2D interior within [0..12]×[0..20]. - **Player/agent count:** 2 teams of 5 agents each (Team A = Attackers, Team D = Defenders). - **Turn model:** Simultaneous discrete execution ticks (Δt=1 step per round). ## Formal rules R1. Setup: - Defenders spawn on their assigned lines: D0 at (6,0), D1 on Y=6, D2 on Y=13, D3 on Y=20, and D4 on Y=6 (or Y=13) [gap-fill]. - Attackers spawn in the entry buffer zone Y<0. R2. Action execution: Every tick, all active agents submit a movement vector v→∈{(0,1),(0,−1),(1,0),(−1,0),(0,0)}. - Defenders must maintain pos+v→ on their assigned line coordinates. - Attackers must maintain pos+v→∈[0..12]×[0..20]. R3. Tagging resolution: - An attacker Ai is tagged at tick t if distance(Ai,Dj)≤1.0 grid unit and defender Dj is on their legal line. - If any attacker is tagged, or if an attacker exits boundary X<0 or X>12, the round immediately terminates as an offensive failure (`turnover = true`). R4. Scoring: - An attacker reaching Y=20 transitions state from `ADVANCING` to `RETURNING` and records 5 forward points. - An attacker with `RETURNING` status reaching Y≤0 completes a full circuit (*baligtaran*), awarding 15 points. R5. Match structure: - Each team plays 2 halves of Tmax⁡=300 ticks as Attackers and 2 halves as Defenders [gap-fill]. Aggregate points across all innings decide the winner. ## Edge cases - Tie at the end condition: If aggregate points are equal at match conclusion, a 1-attacker vs 5-defenders sudden-death round of 60 ticks is executed; if the attacker scores, Team A wins, otherwise Team B wins [gap-fill]. - A player with no legal move: (0,0) (remain stationary) is always legal for both roles. - Repetition / cycles: Strictly bounded by the hard countdown clock (Tmax⁡=300 ticks per half). - Simultaneous claims on the same resource or position: Multiple attackers may occupy the same coordinate cell; tagging evaluates all attackers within distance ≤1.0 of any legal defender independently. - Player elimination mid-round: Under traditional instant-turnover rules, a single tag ends the team offensive inning immediately; in individual point-accumulation variants, the tagged agent is removed (`eliminated = true`) while others continue. - Resource exhaustion: Infinite moves available within the discrete time limit. - Termination guarantee: Enforced by the finite tick ceiling Tmax⁡. ## State representation - Persistent state: - `attacker_pos`: array of 5 coordinates (x,y). - `defender_pos`: array of 5 coordinates (x,y). - `attacker_status`: array of 5 enums (`STAGING`, `ADVANCING`, `RETURNING`, `COMPLETED`, `TAGGED`). - `score_team_A`, `score_team_B`: integers. - `current_tick`: integer 0..300. - Observable information: Fully observable public game state (all coordinates, rails, and timer are visible to all agents). ## Action space - `move(dx, dy)`: Δx∈{−1,0,1},Δy∈{−1,0,1} such that |Δx|+|Δy|≤1, subject to rail constraints for defenders and boundary box for attackers. ## Playability notes - Single-player-vs-AI: Fully playable by assigning 1 human/agent to control an attacker against a scripted/RL defensive squad. - Group games (n>4): Cleanly reduces to 1 Attacker vs 3 Defenders on a 2-box mini-court without loss of evasion geometry. - Physical-skill games: Physical body feints, sudden deceleration, and arm reach are abstracted into discrete 4-way orthogonal grid choices and a 1-cell tag radius. - What is lost in the adaptation: Continuous momentum, physical arm reach, and side-stepping body flexion are discretized. ## Implementation hints Grid-based 2D matrix with coordinate bounding checks. Joint action space is 55=3,125 states per team per tick. First milestone: Implement a 1v2 agent chase on a single square grid to verify tagging proximity and boundary checks.

Download as JSON

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

Download JSON
Cite this page

Grid Line Evasion / Tag (Philippines). (n.d.). Games of Countries. https://gamesofcountries.com/games/ph-philippines/patintero

@misc{gamesofcountries-ph-philippines-patintero,
  title = {Grid Line Evasion / Tag (Philippines)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/ph-philippines/patintero}
}