Formal Specification
White Poplar, Green Poplar — Formal Specification
Kyrgyzstan · chase-tag · Confidence: low
← Back to game pageImplementation Suitability
Suitability: engine-readyFidelity: discretizedGap-fills: 1
# Ak terek, kök terek — AI-optimized specification
## General idea
A turn-based team strategy and physical-momentum game. Two opposing teams form interlocked living chains of linked hands across a field. Teams take turns summoning an opposing runner by name, who sprints across the field to break through a targeted link in the defensive chain. Breaking the link captures an opponent; failing to break absorbs the runner into the defending team.
## Formal model
- **Abstraction taken:** Team chains modeled as an ordered graph of linked nodes. Link grip strength is calculated as the sum of adjacent agents' strength and grip attributes. The runner's kinetic energy is calculated from runner mass, speed, and sprint acceleration.
- **Player/agent count:** 2 teams of N agents (e.g. N = 8, total 16 agents).
- **Turn model:** Strictly alternating rounds (Team A summons from Team B, then Team B summons from Team A).
## Formal rules
R1. Setup: Team A and Team B initialized with rosters of N agents each. Chains initialized as ordered lists of connected agents: `Chain_A = [a_1, a_2, ..., a_N]`, `Chain_B = [b_1, b_2, ..., b_N]`.
R2. Phase 1 — Dialogue & Target Summoning:
- Active Team selects one target runner from the opposing team's roster based on strategic threat/vulnerability evaluation.
R3. Phase 2 — Target Link Selection:
- The summoned runner chooses which adjacent pair of defenders `(d_i, d_{i+1})` in the opposing chain to charge into.
R4. Phase 3 — Collision Resolution:
- Defending Link Strength: `S_def = (grip_strength(d_i) + grip_strength(d_{i+1})) * stance_modifier`.
- Runner Momentum: `M_run = (mass(runner) * top_speed(runner)) + stochastic_surge_roll`.
- Breakthrough Condition: If `M_run > S_def`:
- **Breakthrough:** Runner wins. Runner chooses one defender from `{d_i, d_{i+1}}` to capture. Captured defender is removed from the defending chain and appended to the runner's team chain.
- Hold Condition: If `M_run <= S_def`:
- **Defensive Hold:** Defenders win. Runner is captured, removed from their original team, and inserted between `d_i` and `d_{i+1}` in the defending chain.
R5. Turn Alternation: The defending team now becomes the summoning team for the next round.
R6. Win Condition: The game ends when one team absorbs all opposing players (reducing opposing team size to < 2), or after an agreed limit of 20 rounds. The team with the larger roster wins.
## Edge cases
- Tie at the end condition: Equal roster sizes at round 20 results in an official draw.
- A player with no legal move: Not applicable; chain selection is always valid.
- Repetition / cycles: [gap-fill] Upper bound of 20 rounds prevents endless player ping-pong oscillations.
- Simultaneous claims on the same resource or position: Strictly alternating discrete turns.
- Player elimination mid-round; turn order repair: When a team is reduced to 1 player, that player cannot form a chain link and is automatically captured on the next charge, ending the match.
- Resource exhaustion: Total player count across both teams is strictly invariant (sum = 2N).
- Termination guarantee: Enforced by the 20-round limit and the total-absorption threshold.
## State representation
- Persistent state: `Team_A` roster (list of agent IDs), `Team_B` roster (list of agent IDs), round number (1..20), active attacking team (A or B).
- Agent attributes: `mass` (float), `speed` (float), `grip_strength` (float), `stamina` (float).
- Ephemeral state: Active summoned runner, target link indices `(i, i+1)`.
- Observability: Complete visibility of all agent attributes and team ordering.
## Action space
- `summon_runner(opponent_agent_id)`: Active team's tactical selection.
- `charge_link(target_index)`: Runner's chosen link index in the defending chain.
## Playability notes
- Single-player-vs-AI: Enjoyable as a squad-management and matchmaking strategy game.
- Group games: Easily compressed to 2 human captains managing whole chains.
- Physical skill: Discretized into strength/speed/grip formulas and weakest-link identification.
- What is lost: The physical impact of hitting linked arms and the communal singing rhythm.
## Implementation hints
Low complexity. Can be implemented in under 100 lines of code with list manipulations and probability thresholds. First milestone: implement roster transfers and verify total agent conservation across 10 rounds.
Download as JSON
Download the full game corpus entry for this game as structured JSON.
Download JSONCite this page
White Poplar, Green Poplar (Kyrgyzstan). (n.d.). Games of Countries. https://gamesofcountries.com/games/kg-kyrgyzstan/ak-terek-kok-terek
@misc{gamesofcountries-kg-kyrgyzstan-ak-terek-kok-terek,
title = {White Poplar, Green Poplar (Kyrgyzstan)},
year = {n.d.},
publisher = {Games of Countries},
url = {https://gamesofcountries.com/games/kg-kyrgyzstan/ak-terek-kok-terek}
}