Formal Specification
Sindhi Compartment Court Tag — Formal Specification
Pakistan · chase-tag · Confidence: low
← Back to game pageImplementation Suitability
Suitability: engine-readyFidelity: discretizedGap-fills: 2
# Wanjhwati — AI-optimized specification
## General idea
A turn-based team grid-evasion game played on a 1D sequence of 2D compartments. Defending agents are constrained to patrol along 1D line segments (transverse boundary lines and one central longitudinal spine), while invading agents navigate through the 2D interior chambers to reach the far endline and complete a return loop without being intercepted.
## Formal model
- **Abstraction taken:** The court is modeled as a 2D grid partitioned into `M = 5` chambers along the Y-axis: `y in [0, 20]`, `x in [-4, 4]`.
- Transverse lines exist at `y in {0, 4, 8, 12, 16, 20}`.
- Central spine line exists at `x = 0, y in [0, 20]`.
- **Player/agent count:** 2 teams of `K = 5` agents (Defenders `D_0..D_4`, Invaders `I_1..I_K`).
- **Turn model:** Discrete real-time simulation ticks `Delta_t = 0.5` seconds within each raid turn.
## Formal rules
R1. Setup:
- Transverse Defender `D_j` (for `j in {0..3}`) patrols strictly on horizontal segment `y = 4 * (j + 1), x in [-4, 4]`.
- Spine Captain `D_4` patrols strictly on vertical segment `x = 0, y in [0, 20]`.
- Invaders `I_1..I_K` start in the home chamber `y < 0`.
R2. On each tick:
- Defenders update 1D positions along their assigned line segments with max speed `v_def = 1.5` units/tick.
- Invaders update 2D positions `(x, y)` inside chambers with max speed `v_inv = 1.2` units/tick.
R3. Interception check:
- If an invader `I_k` attempts to cross line `y = 4*(j+1)` and `|x_{I_k} - x_{D_j}| <= r_reach` (reach radius 0.8 units), an interception check resolves:
- If defender intercepts: Invader `I_k` is eliminated (`eliminated[I_k] = True`).
- If `I_k` crosses spine `x = 0` and `|y_{I_k} - y_{D_4}| <= r_reach`: Spine captain intercepts -> `I_k` eliminated.
R4. Boundary check: If an invader steps outside `|x| > 4.0` or `y < -2.0`: `I_k` is eliminated.
R5. Circuit completion:
- When `I_k` reaches `y >= 20.0`, state updates to `reached_far_end[I_k] = True`.
- When `I_k` with `reached_far_end == True` returns safely to `y <= 0`, `I_k` scores 1 point for the invading team.
R6. Turn resolution:
- If all invaders are eliminated or successfully return, the attacking turn ends.
- Roles swap after each turn.
R7. [gap-fill] Match end: Total 4 turns (2 invasion turns per team). Team with higher point score wins.
R8. [gap-fill] Tie-break: Sudden-death single invader vs 5 defenders speed run.
## Edge cases
- **Tie at the end condition:** Handled by sudden-death single runner sprint (R8).
- **A player with no legal move:** Movement along designated line or chamber interior always admits zero displacement `(0, 0)`.
- **Repetition / cycles:** Bounded because an invasion turn has a maximum duration limit of 300 ticks; invaders not completing the loop within 300 ticks are eliminated.
- **Simultaneous claims on the same resource or position:** Multiple invaders can occupy the same chamber or cross different portions of the same line simultaneously.
- **Player elimination mid-round:** Eliminated invaders are removed from active grid updates; remaining invaders continue.
- **Resource exhaustion:** Invaders decrement monotonically if intercepted.
- **Termination guarantee:** Guaranteed by finite turn tick limit (300 ticks per turn) across 4 turns.
## State representation
- **Persistent state:** `scores[A, B]`, `current_turn in {1..4}`, `attacking_team in {A, B}`.
- **Per-tick ephemeral state:** Coordinates for 5 defenders and remaining active invaders, `reached_far_end[1..K]`, `eliminated[1..K]`, `tick_counter in {1..300}`.
- **Observable information:** Fully observable 2D state for all agents.
## Action space
- `patrol_move(d_line)`: 1D displacement along assigned segment (Defenders).
- `chamber_move(dx, dy)`: 2D displacement within boundary limits (Invaders).
## Playability notes
- **Single-player-vs-AI:** Natural; human player can control an invader coordinating feints to slip past AI line guards, or play as the mobile spine captain.
- **Group games (n>4):** Native team structure (5v5).
- **Physical-skill games:** Tag radius and reach timing are parameterized via geometric distance thresholds.
- **What is lost:** The bodily feints, rapid weight shifts, and the collective vocal taunts between opposing teams.
## Implementation hints
Low-to-medium complexity. The geometry is clean: 4 horizontal line constraints, 1 vertical line constraint, and 5 rectangular bounding boxes. Build the 1D line clamping logic first before hooking up multi-agent invader pathfinding.
Download as JSON
Download the full game corpus entry for this game as structured JSON.
Download JSONCite this page
Sindhi Compartment Court Tag (Pakistan). (n.d.). Games of Countries. https://gamesofcountries.com/games/pk-pakistan/wanjhwati
@misc{gamesofcountries-pk-pakistan-wanjhwati,
title = {Sindhi Compartment Court Tag (Pakistan)},
year = {n.d.},
publisher = {Games of Countries},
url = {https://gamesofcountries.com/games/pk-pakistan/wanjhwati}
}