Skip to main content
Formal Specification

Sack Races (Cypriot Burlap Sack Jumping) — Formal Specification

Cyprus · strength-endurance · Confidence: low

← Back to game page

Implementation Suitability

Suitability: engine-readyFidelity: probabilistic-proxyGap-fills: 2
# Sakkoulodromies — AI-optimized specification ## General idea A simultaneous discrete-time race simulation where agents balance jump power against stumble risk. In each tick, agents choose a hopping velocity/cadence; higher speeds increase forward advancement per tick but exponentially increase the probability of losing balance, requiring recovery ticks to regain standing posture. ## Formal model - **Abstraction taken:** 1D continuous sprint track of length D (e.g. D=30 meters) discretized into meters or grid cells. Physical balance, leg-binding friction, and jumping mechanics are modeled as a stochastic state-space system with risk/speed trade-offs. - **Player/agent count:** N racing agents (A1,…,AN), where 2≤N≤8. - **Turn model:** Simultaneous tick-based simulation. All agents submit hop intensity actions simultaneously each tick until one or more agents cross the finish line D. ## Formal rules R1. **Initial Setup:** Track length D. For all agents i∈{1..N}, initial position xi=0, velocity vi=0, posture Posturei=STANDING, stamina Ei=100, and recovery timer Ri=0. R2. **Action Selection:** Each tick, an agent in STANDING posture chooses an action ai∈{CAUTIOUS_HOP,STANDARD_HOP,POWER_HOP}: - CAUTIOUS_HOP: Forward advance Δx=1, Stamina cost ΔE=1, Fall probability Pfall=0.02. - STANDARD_HOP: Forward advance Δx=2, Stamina cost ΔE=3, Fall probability Pfall=0.08. - POWER_HOP: Forward advance Δx=3, Stamina cost ΔE=6, Fall probability Pfall=0.22. R3. **Stumble and Fall Resolution:** - For each agent choosing hop action, sample u∼Uniform(0,1). - If u<Pfall×(1+max⁡(0,(50−Ei)/50)): - Posturei←FALLEN. - Ri←2 (agent must spend 2 ticks recovering upright) [gap-fill]. - Forward advance for this tick is halved (⌊Δx/2⌋). - Otherwise: xi←xi+Δx. R4. **Recovery Dynamics:** - If Posturei==FALLEN: The agent's only legal action is `recover()`. - Ri←Ri−1. - When Ri==0, Posturei←STANDING. R5. **Stamina Dynamics:** - Stamina regenerates by +1 if performing CAUTIOUS_HOP or `recover()`, up to maximum 100. R6. **Finish Line & Victory:** - The race ends at the conclusion of the tick in which at least one agent satisfies xi≥D. - The winner is the agent with the largest position xi≥D. R7. [gap-fill] If multiple agents cross D on the exact same tick with identical distance xi, the agent with higher remaining stamina Ei is awarded the tiebreaker victory; if stamina is identical, an exact tie is recorded. ## Edge cases - **Tie at the end condition:** Handled by stamina tiebreaker and joint finish evaluation in R6/R7. - **A player with no legal move:** A standing agent always has hop choices; a fallen agent always has `recover()`. - **Repetition / cycles:** Progress is monotonically non-decreasing (xi(t+1)≥xi(t)); no backward movement exists, guaranteeing advancement. - **Simultaneous claims on the same resource or position:** Racers occupy independent parallel lanes; collisions between racers are not modeled (no blocking). - **Player elimination mid-round:** Not applicable — all racers continue until the finish line is reached. - **Resource exhaustion:** Stamina does not drop below 0; if Ei=0, only CAUTIOUS_HOP is permitted. - **Termination guarantee:** Because minimum advance is ≥0 and non-zero hops occur with P>0, distance D is guaranteed to be reached within finite ticks Tmax⁡≤⌈D/0.5⌉+falls×2. ## State representation - **Persistent state:** Track distance D, agent roster size N. - **Per-tick state:** For each agent i: position xi∈[0,D+10], stamina Ei∈[0,100], posture state Posturei∈{STANDING,FALLEN}, recovery counter Ri∈{0,1,2}, elapsed ticks t. - **Observable information:** Fully observable — all racers see the exact positions, postures, and stamina estimates of all competitors. ## Action space - `hop(intensity)`: Valid when Posture==STANDING, with intensity∈{CAUTIOUS,STANDARD,POWER}. - `recover()`: Valid and mandatory when Posture==FALLEN. ## Playability notes - **Single-player-vs-AI:** Highly playable push-your-luck racing game where the player dynamically adjusts jump cadence based on AI competitor positions and stamina reserves. - **Group games (n>4):** Scales trivially to any number of concurrent agents due to independent parallel lanes. - **Physical-skill games:** Physical leg power and somatic balance are parameterized into stochastic failure curves. - **What is lost:** The direct biomechanical feeling of hopping inside scratchy hessian cloth and the humorous physical tumbling is abstracted into recovery ticks. ## Implementation hints Model as a simple discrete Markov race. Compute optimal dynamic programming policies: when trailing, switch to POWER_HOP; when leading with a comfortable margin, switch to CAUTIOUS_HOP. First milestone: implement the 1D race loop with deterministic hops, then plug in the stochastic stumble sampler.

Download as JSON

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

Download JSON
Cite this page

Sack Races (Cypriot Burlap Sack Jumping) (Cyprus). (n.d.). Games of Countries. https://gamesofcountries.com/games/cy-cyprus/sakkoulodromies

@misc{gamesofcountries-cy-cyprus-sakkoulodromies,
  title = {Sack Races (Cypriot Burlap Sack Jumping) (Cyprus)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/cy-cyprus/sakkoulodromies}
}