Formal Specification
Long Pole Tag — Formal Specification
Malaysia · chase-tag · Confidence: low
← Back to game pageImplementation Suitability
Suitability: engine-readyFidelity: discretizedGap-fills: 2
# Galah Panjang — AI-optimized specification
## General idea
A two-team asymmetric spatial evasion and line-defense game played on a discretized grid graph. Defending agents have constrained 1D degrees of freedom along specific line edges, while attacking agents navigate 2D cells, coordinating feints and breakout sprints to achieve a complete round-trip crossing without intersecting defender reach zones.
## Formal model
- **Abstraction taken:** The continuous 2D playing court is discretized into a planar grid graph. The court comprises rows and columns (8 distinct cells). Defenders move along boundaries (vertices/edges); attackers occupy cells and move between adjacent cells.
- **Player/agent count:** 2 teams of 5 agents each (Team A: Attackers, Team B: Defenders).
- **Turn model:** Simultaneous-turn discrete-time simulation. Each tick , all 10 agents commit actions simultaneously, followed by movement resolution and contact checks.
## Formal rules
R1. Grid topology: Cells are indexed for .
- Row boundaries are horizontal lines .
- Column dividing line is vertical segment between columns 1 and 2.
- Starting safe zone is ; rear turnaround zone is .
R2. Defender constraints:
- Defender 0 (Captain) moves along .
- Defenders are restricted to horizontal lines respectively.
- Defender reach: A defender on line segment exerts a blocking/tagging radius of reach distance into adjacent cells.
R3. Attacker state & progression:
- Each attacker has position , direction flag , and status .
- Attackers move to an orthogonally adjacent cell or remain in place: .
R4. Tagging resolution:
- If an attacker crosses a line boundary while Defender 's coordinate along that line is within reach (), the attacker is tagged.
- If Attacker 1 (Captain) is tagged, the attacking turn ends immediately (turnover of roles).
- If an ordinary Attacker () is tagged, that agent transitions to `ELIMINATED` and is removed from the grid.
R5. Scoring: An attacker who reaches (), sets , and returns safely across without being tagged transitions to `SCORED` and adds +1 to the team's match score.
R6. [gap-fill] Round turnover: An attacking half-round terminates when all attackers are either `ELIMINATED` or `SCORED`, or when the time limit ticks expires. Teams then swap roles.
R7. [gap-fill] Match victory: The match consists of 4 half-rounds (2 attacking periods per team). Team with the highest total score wins.
## Edge cases
- Tie at the end condition: If scores are tied after 4 periods, resolved by sudden-death overtime (first team to score a point wins).
- A player with no legal move: In place hold (`WAIT`) is always legal for all agents.
- Repetition / cycles: Bounded by hard time limit ticks per attacking half-round.
- Simultaneous claims on the same resource: Multiple attackers may occupy the same cell ; however, crossing a contested line tags all crossing attackers simultaneously if the defender is in reach.
- Player elimination mid-round: Eliminated agents are removed; remaining attackers continue their trajectories.
- Resource exhaustion: Not applicable.
- Termination guarantee: Enforced by the finite tick limit per half-round.
## State representation
- Persistent state: `team_scores[2]`, `half_round` (1..4), `role_map` (attacker/defender).
- Per-tick state: `tick_count` , 5 attacker states `(r, c, direction, status)`, 5 defender positions along their respective line coordinates.
- Observable information: Perfect information; all agent positions and orientations are fully visible to all 10 agents.
## Action space
- Attacker action: `move_attacker(direction)` .
- Defender action: `patrol_line(target_coordinate)` along the assigned 1D boundary axis.
## Playability notes
- Single-player-vs-AI: Natural; player commands the 5 attackers against an AI defense coordinate system.
- Group games (n>4): Native 5v5 multi-agent adversarial environment.
- Physical-skill games: Real-time physical agility and arm reach are cleanly discretized into reach-distance tolerances and speed limits.
- What is lost: The physical feinting nuance and split-second momentum shifts are represented as discrete grid steps.
## Implementation hints
Discretize into a cell matrix with floating-point line-slider defenders or a pure integer coordinate graph. First milestone: implement 1v1 line-traversal before scaling to full 5v5 captain-elimination rules.
Download as JSON
Download the full game corpus entry for this game as structured JSON.
Download JSONCite this page
Long Pole Tag (Malaysia). (n.d.). Games of Countries. https://gamesofcountries.com/games/my-malaysia/galah-panjang
@misc{gamesofcountries-my-malaysia-galah-panjang,
title = {Long Pole Tag (Malaysia)},
year = {n.d.},
publisher = {Games of Countries},
url = {https://gamesofcountries.com/games/my-malaysia/galah-panjang}
}