Skip to main content
Formal Specification

White Poplar, Green Poplar / Chain-Breaking Sprint — Formal Specification

Kazakhstan · chase-tag · Confidence: low

← Back to game page

Implementation Suitability

Suitability: adaptation-requiredFidelity: discretizedGap-fills: 6
# Aqterek-kokterek — AI-optimized specification ## General idea Aqterek-kokterek is a team chain-breaking and player-recruitment contest. Two opposing teams stand in parallel lines with interlocked hands; the defending team demands a specific runner from the attacking team via an antiphonal chant. The summoned runner sprints across the field and attempts to smash through a chosen link in the defending human chain. A successful breach captures a defender for the runner's team, while a failed breach absorbs the runner into the defending chain. ## Formal model - **Abstraction taken:** The continuous sprint mechanics and physical collision dynamics of interlocking arm grips are discretized into a tactical roster-recruitment duel. [gap-fill] Each player possesses an athletic mass/sprint momentum attribute Mi∈[0.5,1.5]; when a runner r attacks an adjacent defensive link (d1,d2), the breach probability is modeled as P(breach)=σ(γ⋅[Mr−Md1+Md22]), where γ is a scaling constant. - **Player/agent count:** 2 teams (Team White Poplar and Team Green Poplar), each starting with K players (standard default: 6 players per team). - **Turn model:** Alternating team turns with two sub-phases per turn: (1) Defender summons a runner, (2) Runner targets a defensive link. ## Formal rules R1. **Team Lineup & State Initialization:** - Two teams, TA and TB, each initialize with a roster of K players: |TA|=|TB|=K (K≥3, default 6). - Each team maintains an ordered linear chain of players: T=[p1,p2,…,pm]. - A chain of length m has exactly m−1 defensive links: Lk=(pk,pk+1) for k∈{1..m−1}. - [gap-fill] Team A begins as the challenging team on Turn 1. R2. **The Antiphonal Summoning Phase:** - The active challenging team (Tchal) prompts the defending team (Tdef). - The defending team selects and names one player r∈Tchal to be the runner. R3. **The Breach Attempt:** - The summoned runner r selects one target link Lk=(d1,d2) from Tdef's chain. - **Stochastic Breach Resolution:** - The breach outcome is sampled with probability: P(breach)=11+exp⁡(−β⋅[Mr−0.5(Md1+Md2)]) - **Breach Success:** - Runner r breaks the link. - Runner r selects either d1 or d2 to capture. - The selected defender is removed from Tdef and appended to Tchal's chain. - Runner r returns safely to Tchal. - **Breach Failure:** - The defending link holds firm and stops runner r. - Runner r is captured: removed from Tchal and inserted between d1 and d2 in Tdef's chain. R4. **Turn Alternation:** - After the breach resolves and rosters update, roles reverse: the former defending team becomes the challenging team for the next turn. R5. **End Condition and Match Winner:** - The game ends immediately when either team's roster is reduced to |T|≤1 player (cannot form a 2-person link). - The team holding ≥2K−1 players is declared the winner. - [gap-fill] If neither team achieves victory within 50 total turns, the team with the strictly larger current roster wins; if rosters are exactly equal, the match is a draw. ## Edge cases - **Tie at the end condition:** Explicitly resolved by R5 [gap-fill] (roster count comparison at 50-turn cap; exact tie is a draw). - **A player with no legal move:** When a team is reduced to 1 player, it cannot form a link; R5 triggers immediate match termination. - **Repetition / cycles (and the loop-breaking rule):** Since players transfer back and forth, cycles are possible. Handled by R5 [gap-fill] 50-turn ceiling. - **Simultaneous claims on the same resource or position:** Not applicable; turns alternate strictly, and each breach targets a single link. - **Player elimination mid-round; turn order repair:** Players are transferred between rosters rather than eliminated; chain links are automatically re-indexed after insertions and deletions. - **Resource exhaustion (pieces, tokens, space, time):** Total player population is strictly conserved (|TA|+|TB|=2K). - **Termination guarantee: why the game provably ends:** Guaranteed by the 50-turn global limit [gap-fill] combined with the absorbing states where |T|≤1. ## State representation - **Persistent state:** - `team_A`: Ordered list of player structs `[{id, mass, speed}, ...]`. - `team_B`: Ordered list of player structs. - `turn_number`: Integer 1..50. - `active_challenging_team`: Enum `[TEAM_A, TEAM_B]`. - **Per-turn ephemeral state:** - `summoned_runner_id`: ID of chosen runner from challenging team. - `targeted_link_index`: Index k of link (dk,dk+1) in defending chain. - `breach_succeeded`: Boolean outcome. - `captured_defender_id`: ID of defender selected upon success. - **Observable information:** Fully observable. Roster ordering, player attributes, and chain link configurations are public knowledge. ## Action space - `summon_runner(player_id)`: - Defending team action; `player_id` ∈Tchal. - `attack_link(target_link_index, captured_pick_side)`: - Summoned runner action; `target_link_index` ∈{0..|Tdef|−2}; `captured_pick_side` ∈{left,right}. ## Playability notes - **Single-player-vs-AI:** Natural when structured as two commander agents managing team rosters. AI commander selects opponent runners with lower mass/momentum and attacks the weakest link in the opponent chain. - **Group games (n>4):** Naturally a multi-player group game; the 2-commander abstraction encapsulates all individual player choices cleanly. - **Physical-skill games:** Physical sprinting impact and grip strength are parameterized by player attributes Mi∈[0.5,1.5]. - **What is lost in the adaptation:** Physical sting of shoulder impacts, pain of strained fingers, cheering resonance of the rhythmic rhyming chants, and sudden feints along the line. ## Implementation hints - Represent team chains as standard dynamic lists. When a player is transferred, handle list deletion and insertion cleanly to maintain link connectivity. - Strategic depth arises from chain topology: smart commanders place high-mass anchors at strategic intervals to prevent runners from finding easy adjacent weak pairs. - First milestone: Implement chain representation, stochastic breach formula, roster transfers, and verify that roster sizes conserve invariant 2K.

Download as JSON

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

Download JSON
Cite this page

White Poplar, Green Poplar / Chain-Breaking Sprint (Kazakhstan). (n.d.). Games of Countries. https://gamesofcountries.com/games/kz-kazakhstan/aqterek-kokterek

@misc{gamesofcountries-kz-kazakhstan-aqterek-kokterek,
  title = {White Poplar, Green Poplar / Chain-Breaking Sprint (Kazakhstan)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/kz-kazakhstan/aqterek-kokterek}
}