Skip to main content
Formal Specification

Line-Crossing Barrier Tag (Grid Infiltration Game) — Formal Specification

Myanmar · chase-tag · Confidence: high

← Back to game page

Implementation Suitability

Suitability: engine-readyFidelity: discretizedGap-fills: 3
# Htoke-see-toe — AI-optimized specification ## General idea A tactical team territory infiltration and barrier evasion game. Two teams alternate roles as Attackers (*Toe-thu*) and Defenders (*Hpan-thu*). Attackers attempt to infiltrate through a succession of rectangular defensive chambers from the front line to the back line and return safely to the base. Defenders are constrained to patrol strictly along transversal lines and a central longitudinal spine line, attempting to tag any passing attacker. ## Formal model - **Abstraction taken:** The continuous rectangular court (12×6 meters) is discretized into a 2D coordinate grid of size X∈[0,4], Y∈[0,6]. Transversal boundary lines exist at Y∈{0,2,4,6}; a central spine line runs along X=2 for Y∈[0,6]. Attackers occupy chamber interior cells (x,y)∈[0,4]×[0,6], while Defenders are mathematically restricted to coordinates satisfying their designated line equations. - **Player/agent count:** 2 teams of K=5 or 6 agents (Team A and Team B). - **Turn model:** Synchronous discrete time ticks t=1,2,…,Tmax⁡. In each tick, all agents simultaneously submit displacement vectors Δ∈{(0,0),(0,1),(0,−1),(1,0),(−1,0)}. ## Formal rules R1. **Court & Roster Partition:** - The court comprises 3 transverse chambers divided into left (X<2) and right (X>2) compartments. - Defending team assigns 1 `Captain` (permitted movement: transversal line Y=0 AND spine line X=2) and K−1 `Line Guards`, each assigned strictly to one transversal line Y=2,4,6. - Attacking team places all K agents at the starting baseline Y<0. R2. **Movement Constraints:** - *Defenders:* Each defender dj must remain strictly on their assigned line coordinates. Maximum speed: 1 grid unit per tick. - *Attackers:* May move freely within [0,4]×[0,6]. Moving outside the lateral court boundaries (X<0 or X>4) results in immediate elimination. R3. **Tagging Mechanics:** - A tag occurs at tick t if the Euclidean distance between any defender d (on their legal line) and any attacker a satisfies ‖pos(d)−pos(a)‖≤1.0 (Manhattan adjacency or co-location). - If a tag occurs: the attacking team's inning terminates immediately; roles swap for the next inning. R4. **Scoring & Penetration (*Htoke Pauk*):** - An attacker a achieves *Forward Clearance* when reaching Y≥6 (the tail line / *Mee Htoke*). - An attacker who has achieved Forward Clearance and subsequently returns across the front line (Y≤0) scores +1 point (*Htoke Pauk*) for the team. - Upon scoring, that attacker is safe and removed from the active court for the remainder of that inning. R5. **Inning Structure & Match Limit:** - A match consists of M=4 innings (each team attacks twice). - An inning ends immediately if: (1) an attacker is tagged, (2) all attackers successfully score, or (3) the tick counter reaches Tmax⁡=100 ticks [gap-fill]. R6. **Victory Condition:** The team with the highest cumulative penetration score across their attacking innings wins the match. ## Edge cases - Tie at the end condition: If both teams score equal points after 4 innings, a 1-inning sudden-death tiebreaker is played with Tmax⁡=50; the team scoring faster or penetrating deeper wins [gap-fill]. - A player with no legal move: Not applicable; (0,0) (stationary wait) is always a valid legal action for both roles. - Repetition / cycles: Attackers may stall by moving back and forth within a chamber; bounded strictly by the hard tick cap Tmax⁡=100 per inning in R5. - Simultaneous claims on the same resource or position: Attackers may occupy the same cell; multiple simultaneous tags in one tick all trigger the single inning-termination event. - Player elimination mid-round; turn order repair: When playing under single-player elimination variants, tagged attackers are removed from the active set; remaining attackers continue uninterrupted [gap-fill]. - Resource exhaustion (pieces, tokens, space, time): Discrete spatial grid [0,4]×[0,6] is static; match time bounded by 4×Tmax⁡. - Termination guarantee: why the game provably ends: Guaranteed by strictly monotonic tick counter t→Tmax⁡=100 in every inning. ## State representation - **Persistent state:** Court grid bounds, team rosters, current inning m∈{1…4}, role assignments (`AttackingTeam`, `DefendingTeam`), total match scores {SA,SB}. - **Per-turn ephemeral state:** Tick counter t∈{1…100}, agent coordinates {pos(i)}, forward-clearance flags per attacker {cleared(a)}, active status per agent. - **Observable information:** Fully observable; all player positions, line assignments, and clearance flags are public knowledge. ## Action space - `move(direction)`: Direction ∈{STAY,UP,DOWN,LEFT,RIGHT}. Precondition: Target cell must obey agent's role boundary constraints. ## Playability notes - Single-player-vs-AI: Excellent candidate for multi-agent reinforcement learning; 1 human/AI controlling the attacking squad executing diversionary splits against a coordinated defensive line-guard policy. - Group games (n>4): Squads of 5–6 agents are controlled by unified team policies or individual decentralized agents communicating via shared observation vectors. - Physical-skill games: Physical feinting, sprinting, and reach agility are discretized into grid movement points, line constraints, and collision radii. - What is lost in the adaptation: The sudden physical reflexes of rapid lunges, dodge contortions, and barefoot friction on village soil. ## Implementation hints Low complexity, grid-based multi-agent environment. Ideal for standard OpenAI Gym / PettingZoo matrix wrappers. Key implementation detail: enforce simultaneous movement validation where defender collision checks execute against interpolated agent paths to prevent "tunneling" through lines in a single tick. First milestone: implement 1v1 corridor tag before scaling to full 5v5 multi-chamber grid.

Download as JSON

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

Download JSON
Cite this page

Line-Crossing Barrier Tag (Grid Infiltration Game) (Myanmar). (n.d.). Games of Countries. https://gamesofcountries.com/games/mm-myanmar/htoke-see-toe

@misc{gamesofcountries-mm-myanmar-htoke-see-toe,
  title = {Line-Crossing Barrier Tag (Grid Infiltration Game) (Myanmar)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/mm-myanmar/htoke-see-toe}
}