Formal Specification
Sack Races (Cypriot Burlap Sack Jumping) — Formal Specification
Cyprus · strength-endurance · Confidence: low
← Back to game pageImplementation 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 (e.g. 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:** racing agents (), where .
- **Turn model:** Simultaneous tick-based simulation. All agents submit hop intensity actions simultaneously each tick until one or more agents cross the finish line .
## Formal rules
R1. **Initial Setup:** Track length . For all agents , initial position , velocity , posture , stamina , and recovery timer .
R2. **Action Selection:** Each tick, an agent in posture chooses an action :
- : Forward advance , Stamina cost , Fall probability .
- : Forward advance , Stamina cost , Fall probability .
- : Forward advance , Stamina cost , Fall probability .
R3. **Stumble and Fall Resolution:**
- For each agent choosing hop action, sample .
- If :
- .
- (agent must spend 2 ticks recovering upright) [gap-fill].
- Forward advance for this tick is halved ().
- Otherwise: .
R4. **Recovery Dynamics:**
- If : The agent's only legal action is `recover()`.
- .
- When , .
R5. **Stamina Dynamics:**
- Stamina regenerates by if performing 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 .
- The winner is the agent with the largest position .
R7. [gap-fill] If multiple agents cross on the exact same tick with identical distance , the agent with higher remaining stamina 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 (); 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 , only is permitted.
- **Termination guarantee:** Because minimum advance is and non-zero hops occur with , distance is guaranteed to be reached within finite ticks .
## State representation
- **Persistent state:** Track distance , agent roster size .
- **Per-tick state:** For each agent : position , stamina , posture state , recovery counter , elapsed ticks .
- **Observable information:** Fully observable — all racers see the exact positions, postures, and stamina estimates of all competitors.
## Action space
- `hop(intensity)`: Valid when , with .
- `recover()`: Valid and mandatory when .
## 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 ():** 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 ; when leading with a comfortable margin, switch to . 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 JSONCite 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}
}