Skip to main content
Formal Specification

Single-Leg Hopping Combat — Formal Specification

Afghanistan · chase-tag · Confidence: low

← Back to game page

Implementation Suitability

Suitability: adaptation-requiredFidelity: discretizedGap-fills: 3
# Khusay — AI-optimized specification ## General idea A single-leg hopping team combat and territorial raid game. Players must maintain a continuous one-legged hopping stance while gripping the opposite ankle behind their back. The attacking team sends a hopping raider across the center line into defending territory to topple the defenders' earthen goal mound (*barosa*) and return home safely, while defending hoppers use shoulder-checks and body blocks to force the raider off balance or out of bounds. ## Formal model - **Abstraction taken:** Continuous physical single-leg balance, human body inertia, shoulder-impact physics, and foot gripping are discretized onto a 2D field grid (X∈[0,10],Y∈[0,6]). The center dividing line is at X=5. Defending goal mound (*barosa*) is at (9,3). Movement occurs at 1 grid cell per tick with dynamic balance points and stochastic unbalancing contest resolvers. - **Player/agent count:** 2 teams (Team A and Team B), 5 to 8 agents per team, with 1 active raider and M active defenders on field per raid round. - **Turn model:** Alternating raid rounds; each raid is executed as a simultaneous-tick simulation capped at Tmax=30 ticks. [gap-fill: 30-tick duration cap per raid]. ## Formal rules R1. **Setup:** The field spans X∈[0,10],Y∈[0,6]. - Center dividing line: X=5. - Team A Home Territory: X<5. - Team B Home Territory: X≥5. - Team B Goal Mound (*Barosa*): Zone `(9, 3)` with status `INTACT`. - All active players initialize in state `HOPPING` with `balance = 100` and `stamina = 100`. R2. **Postural Constraint & Immediate Elimination:** - Any agent whose balance drops to 0, who releases their held ankle, whose second foot touches the ground, or who steps outside the boundary (Y<0 or Y>6) immediately enters state `ELIMINATED` and is removed from the current raid. R3. **Simultaneous Round Actions:** Each tick, the raider and all active defenders simultaneously select an action: - `HOP_MOVE(dx, dy)`: Move 1 cell in cardinal or diagonal direction (|dx|≤1,|dy|≤1). - `SHOULDER_BLOCK(target_agent)`: Attempt an unbalancing shoulder charge against an adjacent agent (|x1−x2|≤1,|y1−y2|≤1). - `BRACE_STANCE()`: Maintain position, absorbing incoming charges (+30% balance defense, 0 movement). - `DEMOLISH_BAROSA()`: (Raider only) Kick and topple the defending goal mound (valid only when co-located at `(9, 3)`). R4. **Unbalancing & Collision Contest:** - When a defender executes `SHOULDER_BLOCK` on the raider: ΔB=(Defender_Power−Raider_Defense)+𝒩(0,4) - If ΔB>0, Raider loses ΔB×1.5 balance points and is knocked back 1 cell away from the defender. - If multiple defenders block simultaneously, their power values sum, creating massive unbalancing pressure. - If ΔB≤−5, the defending blocker loses balance from the deflection and risks self-elimination. - [gap-fill: collision formula and multi-defender stacking mechanics]. R5. **Scoring & Raid Resolution:** - **Successful Raid (+1 Point):** The raider executes `DEMOLISH_BAROSA()` at `(9, 3)` (setting `barosa = TOPPLED`) AND successfully moves back across the center line (X<5) without being eliminated. The attacking team scores +1 point. - **Failed Raid (0 Points):** If the raider is eliminated (balance reaches 0 or forced out of bounds) or if tick 30 elapses before returning across X=5, the raid fails with 0 points. R6. **Role Alternation & Match Victory:** - After each raid concludes, teams switch roles (previous defending team becomes the raiding team). - The first team to accumulate 5 raid points wins the match. ## Edge cases - Tie at the end condition: If both teams reach 5 points in the same round cycle, a 1v1 sudden-death raid is played (1 raider vs. 1 defender); first team to score or defend successfully wins. [gap-fill: 1v1 sudden death for ties]. - A player with no legal move: Not applicable; an active agent always has a valid `HOP_MOVE(0, 0)` (hold position) or `BRACE_STANCE` action. - Repetition / cycles: Bounded strictly by the 30-tick limit per raid and the 5-point match victory threshold. - Simultaneous claims on the same resource or position: Grid cells permit multiple defenders; if multiple defenders charge the raider on the same tick, charges combine into a single stacked contest resolver (R4). - Player elimination mid-round; turn order repair: Eliminated defenders are removed immediately from the field grid; remaining defenders continue without simulation disruption. - Resource exhaustion (pieces, tokens, space, time): Raid clock (30 ticks) strictly exhausts. - Termination guarantee: Provably terminates because the tick counter increments monotonically to 30 each raid, and the match point target (5 points) enforces finite game length. ## State representation - **Persistent state:** - `match_scores`: `{team_a: integer, team_b: integer}` - `current_raid_number`: integer - `raiding_team`: `Team A | Team B` - `barosa_status`: `INTACT | TOPPLED` - `raider_state`: `{id, pos: (x, y), balance: 0..100, status: ACTIVE | ELIMINATED}` - `defenders`: list of `{id, pos: (x, y), balance: 0..100, status: ACTIVE | ELIMINATED}` - **Per-turn ephemeral state:** - `tick_counter`: integer (1..30) - `submitted_actions`: map of `agent_id -> Action` - `collision_events`: list of resolved charge deltas - **Observable information:** Fully observable. Positions of all hopping agents, balance levels, and distance to center line / *barosa* are public. ## Action space - `hop_move(dx, dy)`: Precondition: |dx|≤1,|dy|≤1, agent is `ACTIVE`. - `shoulder_block(target_id)`: Precondition: Target is adjacent (L∞≤1) and `ACTIVE`. - `brace_stance()`: Precondition: Agent is `ACTIVE`. - `demolish_barosa()`: Precondition: Agent is Raider, `pos == (9, 3)`, and `barosa_status == INTACT`. ## Playability notes - Single-player-vs-AI: Excellent tactical game. As the raider, the player navigates defensive gauntlets using agility and feints; as the defending coordinator, the player orchestrates pincer movements to trap the raider. - Group games (n>4): Standard 6v6 format scales down cleanly to a 2-agent duel (1 Raider vs. 1 Defender) in a narrowed 6×4 field corridor without changing any rules. - Physical-skill games: Single-leg balance stamina and shoulder impact resistance are parameterized as numerical balance pools and mass attributes. - What is lost in the adaptation: The severe physical pain of barefoot hopping on rough gravel, cramping in the gripped leg, and the roaring energy of rural village spectators. ## Implementation hints Medium complexity. The grid movement and collision stacking logic are straightforward to implement. Suggested first milestone: implement the 1v1 raider vs. defender movement and single-collision balance check on a simplified grid, then add multi-defender stacking and the *barosa* destruction condition.

Download as JSON

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

Download JSON
Cite this page

Single-Leg Hopping Combat (Afghanistan). (n.d.). Games of Countries. https://gamesofcountries.com/games/af-afghanistan/khusay

@misc{gamesofcountries-af-afghanistan-khusay,
  title = {Single-Leg Hopping Combat (Afghanistan)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/af-afghanistan/khusay}
}