Formal Specification
Dariabandha (Salt-Grid Tag) — Formal Specification
Bangladesh · chase-tag · Confidence: high
← Back to game pageImplementation Suitability
Suitability: engine-readyFidelity: discretizedGap-fills: 2
# Daria-bandha — AI-optimized specification
## General idea
A discretized court pursuit game played on a structured rectangular grid divided into 6 compartments (chambers) by transverse line tracks and a central longitudinal spine track. Defending sentries are restricted to patrolling their specific lines, while attacking runners attempt to infiltrate and cross all chambers from the home base to the rear "salt chamber" (*laban ghor*) and return safely to the home base without being tagged.
## Formal model
- **Abstraction taken:** Discretized spatial grid. The court is represented as a cell grid divided into 6 rectangular chambers () arranged in two parallel columns of 3 rows, separated by a central vertical spine line (the *pat daria* track) and horizontal transverse lines (*ara daria* tracks).
- **Player/agent count:** 2 teams of 6 agents: Attacking team () and Defending team ().
- **Turn model:** Real-time ticked simultaneous movement. Defending sentries move along their 1D line tracks; attacking runners move within 2D chamber cells.
## Formal rules
R1. Court Topology:
- 6 Chambers: (Home / *Gadi Ghor*), (Middle Chambers), (Salt Chambers / *Laban Ghor*).
- Longitudinal Spine Track: Center vertical line , running , patrolled exclusively by (*Pat Daria*).
- Transverse Line Tracks: Horizontal lines , patrolled by respectively.
R2. Line Defense Constraints:
- Sentries may move only along their assigned 1D transverse lines ().
- Center Sentry may move along the entire vertical spine line ().
- Defenders may never step into chamber interiors.
- Defenders can tag any attacker whose current cell is immediately adjacent to the defender's current line coordinate.
R3. Attacking Runner Movement:
- Attackers start inside Home Chambers .
- On each tick, attackers submit a move vector .
- Attackers must advance from Home () through Middle () to Salt (), touch the rear boundary, and retrace back to Home.
R4. Tagging and Inning Resolution:
- If any active defender tags an attacker (shares or is orthogonally adjacent to the attacker during a line crossing), the attacking turn immediately fails with 0 points, and teams swap attacking/defending roles.
- If an attacker steps outside the outer court perimeter, the turn immediately fails.
- If at least one attacker completes the full circuit (Home Salt Home) without any team member being tagged, the attacking team earns 1 set point (*এক পাটি - ek pati*).
R5. [gap-fill] Inning Time Limit: An attacking half-inning has a hard ceiling of 120 ticks. If no runner completes the circuit within 120 ticks, the turn ends with 0 points and roles swap.
R6. Match Length: The match consists of alternating half-innings until one team reaches the target score of 3 *pati* (set points).
R7. [gap-fill] Tiebreaker: If tied at 2–2 and 6 innings elapse without a decisive set, sudden-death single-runner speed rounds are played (first clean circuit completed wins).
## Edge cases
- Tie at the end condition: Resolved via sudden-death speed-circuit tiebreaker per R7.
- A player with no legal move: Standing still within a chamber cell is always a legal action.
- Repetition / cycles: Bounded by the 120-tick per-inning ceiling (R5).
- Simultaneous claims on the same resource or position: Defender line-reach tag check executes before attacker chamber transition completes.
- Player elimination mid-round; turn order repair: A single tag by any defender on any runner immediately terminates the entire team's attacking turn (all-or-nothing team survival).
- Resource exhaustion (pieces, tokens, space, time): Inning timer expiration terminates the turn (R5).
- Termination guarantee: The 120-tick hard cap on each half-inning guarantees finite inning progression toward the 3-point victory threshold.
## State representation
- Persistent state:
- `set_scores`: Array of 2 integers (pati count for Team 1 and Team 2).
- `active_attacking_team`: .
- `half_inning`: Integer .
- Per-turn ephemeral state:
- `tick_counter`: Integer .
- `defender_positions`: Array of 6 integers (1D coordinates along respective tracks).
- `attacker_positions`: Array of 6 coordinates.
- `attacker_progress`: Array of 6 enum states `[HOME, ADVANCING_MID, IN_SALT, RETURNING_MID, FINISHED]`.
- Observable information: Fully observable grid state, agent positions, progress markers, and tick clock.
## Action space
- `move_attacker(agent_id, dx, dy)`: Move 1 cell in cardinal directions or hold position inside grid.
- `patrol_defender(defender_id, delta_1d)`: Move unit along assigned 1D track.
## Playability notes
- Single-player-vs-AI: Excellent spatial coordination puzzle; player commands attacking squad while AI executes optimal defensive intercept patrol along lines.
- Group games (n>4): Reduced to a 2-agent match (Attacking Commander vs Defending Coordinator).
- Physical-skill games: Agility, feinting, and sprint acceleration are modeled through discrete movement speeds and zone timing.
- What is lost in the adaptation: The physical tension of reaching across boundary lines and sudden evasive body dodges.
## Implementation hints
Moderate complexity. Grid is small (), allowing rapid evaluation of min-distance paths for attackers and optimal line-coverage algorithms for defenders. Milestone 1: implement grid tracks, defender line clamping, and tag collision detection; Milestone 2: build coordinated multi-runner distraction heuristics for the attacking AI.
Download as JSON
Download the full game corpus entry for this game as structured JSON.
Download JSONCite this page
Dariabandha (Salt-Grid Tag) (Bangladesh). (n.d.). Games of Countries. https://gamesofcountries.com/games/bd-bangladesh/daria-bandha
@misc{gamesofcountries-bd-bangladesh-daria-bandha,
title = {Dariabandha (Salt-Grid Tag) (Bangladesh)},
year = {n.d.},
publisher = {Games of Countries},
url = {https://gamesofcountries.com/games/bd-bangladesh/daria-bandha}
}