Skip to main content
Formal Specification

Stilt Walking — Formal Specification

Netherlands · strength-endurance · Confidence: low

← Back to game page

Implementation Suitability

Suitability: engine-readyFidelity: discretizedGap-fills: 3
# Steltlopen — AI-optimized specification ## General idea A linear spatial sprint race where agents navigate a 1D discrete track on wooden stilts. Agents select stride cadences that balance movement speed against fall probabilities. A ground touch requires spending ticks to remount and rebalance before resuming forward strides. ## Formal model - **Abstraction taken:** Continuous physical balance, dynamic center of mass equilibrium, and leg stride biomechanics are mapped to discrete time ticks on a 1D linear course of length L=40 meters. - **Player/agent count:** 2 to n agents racing concurrently. - **Turn model:** Simultaneous discrete simulation ticks (1.0 second per tick). ## Formal rules R1. **Track setup:** The course is a linear track of length L=40. All agents start at xi=0 in the `mounted` state. R2. **Action selection:** On each tick, every `mounted` agent chooses an action: `stride(pace)` where `pace` ∈{1,2,3}. R3. **Stochastic outcome:** - `pace = 1` (Slow & steady): Advances 1 space. Fall probability P(fall)=0.02. - `pace = 2` (Standard walk): Advances 2 spaces. Fall probability P(fall)=0.12. - `pace = 3` (Sprint stride): Advances 3 spaces. Fall probability P(fall)=0.35. R4. **State transitions:** - If no fall occurs, xi←min⁡(L,xi+pace). - If a fall occurs (P(fall) triggered), xi remains unchanged, and agent transitions to `dismounted` state with `remount_cooldown` =2 ticks [gap-fill]. R5. **Remounting:** While `dismounted`, the agent cannot advance; each tick decrements `remount_cooldown` by 1. When it reaches 0, the agent returns to `mounted` state at position xi. R6. **Win condition:** The first agent to reach xi≥L wins immediately. If multiple agents cross L on the same tick, the agent with the largest final distance wins; if exactly tied, a shared win is declared. ## Edge cases - **Tie at the end condition:** If two or more agents cross L on the same tick with identical distance, victory is shared [gap-fill]. - **A player with no legal move:** Not applicable; mounted agents always have 3 stride choices; dismounted agents execute remount automatically. - **Repetition / cycles:** Impossible; xi is non-decreasing (Δxi≥0), bounded by Tmax⁡=120 ticks [gap-fill]. - **Simultaneous claims on the same resource or position:** Not applicable; agents race in distinct parallel lanes without lateral collision. - **Player elimination mid-round; turn order repair:** Not applicable; all agents race to the finish without elimination. - **Resource exhaustion (pieces, tokens, space, time):** Not applicable; no consumable resources. - **Termination guarantee:** Because P(advance≥1)≥0.65 across all actions, expected forward velocity is strictly positive, ensuring almost-sure termination within finite ticks. ## State representation - **Persistent state:** Track length L, current tick t∈[0,120]. - **Per-agent state:** Position xi∈[0,L], status ∈{mounted,dismounted}, `remount_cooldown` ∈{0,1,2}, skill scalar θi∈[0.5,1.5]. - **Observable information:** Fully observable; all positions, states, and cooldowns are public. ## Action space - `stride(pace)`: Choose pace ∈{1,2,3}. Precondition: status ==mounted. - `remount()`: Automatic recovery action. Precondition: status ==dismounted. ## Playability notes - **Single-player-vs-AI:** Natural; human racer vs. n−1 AI agents with varying risk thresholds. - **Group games (n>4):** Scales arbitrarily with any player count without modifying core mechanics. - **Physical-skill games:** Balance coordination and fear of falling are abstracted as a risk-reward optimization problem. - **What is lost:** Kinesthetic feedback, upper-body grip fatigue, and terrain undulations are simplified into discrete probability scalars. ## Implementation hints - Trivial computational complexity; state is a vector of scalar positions. - Can be solved analytically or simulated via Monte Carlo. - First milestone: Implement the discrete tick loop and benchmark conservative pace=1 against aggressive pace=3 strategies.

Download as JSON

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

Download JSON
Cite this page

Stilt Walking (Netherlands). (n.d.). Games of Countries. https://gamesofcountries.com/games/nl-netherlands/steltlopen

@misc{gamesofcountries-nl-netherlands-steltlopen,
  title = {Stilt Walking (Netherlands)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/nl-netherlands/steltlopen}
}