Formal Specification
Moon Tree, Sun Tree (Turkmen Chain-Breaker Tag) — Formal Specification
Turkmenistan · chase-tag · Confidence: low
← Back to game pageImplementation Suitability
Suitability: adaptation-requiredFidelity: discretizedGap-fills: 4
# Aýterek-günterek — AI-optimized specification
## General idea
A team-assimilation chain-breaking contest where two opposing lines of interlocked agents alternate sending a single designated sprinter to crash through the defenders' joined hands. Successful breaches capture a defending link; failed breaches assimilate the runner into the defending chain, resulting in dynamic roster shifts until one side absorbs the entire opposing team.
## Formal model
- **Abstraction taken:** Full-contact physical sprinting impact against locked arms is modeled as an offensive momentum vs. defensive grip strength contest. Selection of the target defender link and defensive bracing strategy form the core tactical layer, resolved by a parameterized logistic breakthrough probability function.
- **Player/agent count:** 2 teams (Team A and Team B), each initially with agents ().
- **Turn model:** Alternating discrete rounds (Team A attacks Team B attacks).
## Formal rules
R1. **Setup:** Teams A and B start with equal player rosters and . Each team forms a contiguous linear chain with ordered positions .
R2. **Chant & Target Selection:**
- Defending Team D selects and names one offensive runner from the attacking team (*Bizden size kim gerek?* *Saçy uzyn [Name] gerek!*).
- Selected runner chooses a specific target link between two adjacent defenders in team D's chain.
R3. **Breach Resolution:**
- [gap-fill] The breakthrough probability is modeled as , where and .
R4. **Outcome & Roster Transfer:**
- **Success (Breach = True):** The chain is broken. Runner captures one of the two breached defenders ( or , chosen by the runner). The captured defender is removed from and added to .
- **Failure (Breach = False):** The chain holds. Runner is captured, removed from , and inserted into the defending chain between and .
R5. **Turn Alternation:** Offensive initiative swaps strictly to the other team on the next round.
R6. **Victory Condition:** The game terminates immediately when either:
- Team A has absorbed all players (, Team A wins), or
- Team B has absorbed all players (, Team B wins), or
- [gap-fill] A lone surviving player () fails their breakthrough charge, handing total victory to the defending team.
## Edge cases
- Tie at the end condition: Not applicable — roster count is conserved (); one team eventually reaches while the other reaches 0.
- A player with no legal move: When a team has exactly 1 player remaining, that player must be the runner; target link choice remains available.
- Repetition / cycles: While rosters can oscillate (+1, -1), [gap-fill] a maximum round limit terminates the game; the team with the strictly larger roster at is declared the winner.
- Simultaneous claims on the same resource or position: Not applicable — turns and charges are strictly sequential.
- Player elimination mid-round; turn order repair: When a player transfers teams, the losing team closes the gap by shifting adjacent indices: ; the gaining team appends or inserts the new member.
- Resource exhaustion (pieces, tokens, space, time): Player roster total is invariant ( agents total).
- Termination guarantee: why the game provably ends: Guaranteed by absorbing Markov chain dynamics with absorption at or , bounded by .
## State representation
- Persistent state: Team rosters `List[AgentID]` for Team A and Team B, match round counter , active attacking team flag.
- Per-player state: `mass: float`, `speed: float`, `grip_strength: float`, `current_team: {A, B}`, `chain_index: int`.
- Per-turn ephemeral state: Designated runner ID, targeted defender link index pair , sampled breach outcome, transferred player ID.
- Observable information: Fully observable — all player rosters, chain orderings, and individual strength/speed ratings are public knowledge.
## Action space
- `SelectRunner(candidate_id)`: Defending team selects which opponent must sprint. Precondition: Candidate is in offensive team roster.
- `SelectTargetLink(link_index)`: Attacking runner chooses adjacent defender pair to charge. Precondition: .
- `ChooseCaptive(chosen_defender_id)`: [gap-fill] Runner selects which defender of the broken link to absorb. Precondition: Breach was successful.
## Playability notes
- Single-player-vs-AI: Needs adaptation — 1 human player acts as captain of Team A, selecting runner targets and sprint targets against an AI-managed Team B.
- Group games (n>4): Can be reduced to a 2-agent abstract squad commander game where each agent commands a team of simulated runners and defenders.
- Physical-skill games: Physical sprinting collision impact and arm-locking stamina are abstracted into the logistic breach probability function.
- What is lost in the adaptation: The visceral excitement of the full-body collision against locked hands, the stinging arm impact, and the vocal power of the traditional rhyming chant are replaced by tactical link-targeting decisions.
## Implementation hints
Low complexity. Clean state machine with integer team counts and list re-indexing. Branching factor is small ( choices per round). Suggested first milestone: implement a 4v4 team roster transfer simulator with basic breach probabilities, verifying team convergence and edge-case single-player charges.
Download as JSON
Download the full game corpus entry for this game as structured JSON.
Download JSONCite this page
Moon Tree, Sun Tree (Turkmen Chain-Breaker Tag) (Turkmenistan). (n.d.). Games of Countries. https://gamesofcountries.com/games/tm-turkmenistan/ayterek-gunterek
@misc{gamesofcountries-tm-turkmenistan-ayterek-gunterek,
title = {Moon Tree, Sun Tree (Turkmen Chain-Breaker Tag) (Turkmenistan)},
year = {n.d.},
publisher = {Games of Countries},
url = {https://gamesofcountries.com/games/tm-turkmenistan/ayterek-gunterek}
}