Skip to main content
Formal Specification

Long Donkey / Leapfrog Chain — Formal Specification

North Macedonia · strength-endurance · Confidence: low

← Back to game page

Implementation Suitability

Suitability: engine-readyFidelity: abstractedGap-fills: 5
# Долга магарица — AI-optimized specification ## General idea A physical team endurance and precision vaulting game. One team forms a rigid, multi-agent structural chain ("the long donkey") anchored against a wall. Vaulters sequentially run and leap onto the chain, distributing their weight along the segments. The round resolves based on whether the chain collapses under cumulative physical stress, whether a vaulter faults upon landing, or whether the chain holds firm through a countdown. ## Formal model - **Abstraction taken:** The defending chain of K bent-over players is modeled as a 1D array of K connected segments S1…SK, each with a base load tolerance Lcap,j and balance state Bj∈[0,100]. Each vaulter Vi executes a leap parameterized by run-up momentum and landing target index k∈{1..K}. - **Player/agent count:** 2 teams (Tdonkey,Tvaulter) of K agents each (K∈[4,8]) + 1 neutral referee agent. - **Turn model:** Sequential vaulting phase (vaulters V1…VK) followed by a static hold resolution phase. ## Formal rules R1. **Setup:** Chain initialized with K segments S1…SK where S1 is braced against the anchor wall. Each segment Sj has load capacity Lcap,j=150 kg and current load Wj=0. Structural health Hchain=100. R2. **Vaulting Execution:** Vaulters line up in queue Q=⟨V1…VK⟩. On turn i, vaulter Vi (weight wi≈60 kg) submits action `leap_onto_chain(target_index, power)` where targetindex∈{1..K} and power∈(0,1.0]. R3. **Landing Resolution:** - The actual landing segment kland is sampled: kland∼Clamp(𝒩(targetindex,σvault2),1,K). - Landing stability check: If kland is already occupied by ≥2 vaulters, vaulter Vi commits a balance slip with Pslip=0.50. If a slip occurs, Vi touches the ground: the vault phase ends immediately with a Rider Fault. R4. **Structural Load & Chain Stress:** - Upon successful landing on Skland, segment load increases: Wkland←Wkland+wi. - The structural stress damage on the chain is computed: ΔH=∑j=1Kmax⁡(0,Wj−Lcap,j)⋅0.5. - Chain health updates: Hchain←Hchain−ΔH. - If Hchain≤0: The donkey collapses. Vaulters win the round immediately and score +1 point. R5. **Hold & Count Phase:** If all K vaulters mount successfully without a slip and Hchain>0: - The referee executes a 10-tick countdown. Each tick inflicts static fatigue damage dfatigue=2 on Hchain. - If Hchain>0 after 10 ticks: The donkey team successfully withstands the load, scores +1 point, and roles swap (Tdonkey↔Tvaulter). R6. [gap-fill] Rider Fault Role Swap:** If any vaulter commits a landing fault or ground touch, Tdonkey scores +1 point and roles swap immediately. R7. [gap-fill] Match Win Condition:** The first team to accumulate ≥5 points upon an even number of half-innings wins the match. R8. [gap-fill] Sliding Prohibition:** Once an agent lands on segment kland, their position is locked; forward crawling is disallowed by engine state validation. ## Edge cases - Tie at the end condition: If both teams reach 5 points in the same round, an extra sudden-death round is played [gap-fill]. - A player with no legal move: `leap_onto_chain` is always valid for the active vaulter in queue. - Repetition / cycles: Bounded; every round consists of at most K leap actions and a 10-tick hold, yielding deterministic round termination. - Simultaneous claims on the same resource or position: Vaulters leap strictly one at a time in queue order. - Player elimination mid-round: If a player disconnects, their agent weight is treated as an average constant (60 kg). - Resource exhaustion: Chain segments are persistent across the round and reset between rounds. - Termination guarantee: [gap-fill] Monotonic queue advancement and finite hold timer guarantee that every round terminates within K+10 ticks. ## State representation - **Persistent state:** Team scores (Sdonkey,Svaulter), active team role assignments, match rounds. - **Per-round ephemeral state:** Chain structural health Hchain∈[0,100], segment load vector W→∈ℝK, occupant count per segment, active vaulter queue index i∈[1,K]. - **Observable information:** Fully observable; all segment loads, chain health, and rider positions are public. ## Action space - `leap_onto_chain(target_index, power)`: Parameters `target_index` ∈{1..K}, `power` ∈(0,1.0]. Precondition: caller is the active vaulter in queue. ## Playability notes - Single-player-vs-AI: Playable as a timing/target mini-game where the player chooses optimal landing segments to maximize chain stress without overloading a single spot and slipping. - Group games (n>4): Natively accommodates 4v4 to 8v8 teams using the 1D segment array model. - Physical-skill games: Running velocity, hand placement, and balance recovery are abstracted into scalar target sampling and load thresholds. - What is lost in the adaptation: The visceral bone-jarring impact of bodies colliding and the boisterous laughter of collapsing human piles. ## Implementation hints Low-to-medium complexity. The mechanics require a 1D array of structural capacities and a straightforward queue state machine. First milestone: implement R1–R5 with deterministic weights and verify that chain collapse and hold timers trigger correct score updates.

Download as JSON

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

Download JSON
Cite this page

Long Donkey / Leapfrog Chain (North Macedonia). (n.d.). Games of Countries. https://gamesofcountries.com/games/mk-north-macedonia/dolga-magarica

@misc{gamesofcountries-mk-north-macedonia-dolga-magarica,
  title = {Long Donkey / Leapfrog Chain (North Macedonia)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/mk-north-macedonia/dolga-magarica}
}