Skip to main content
Formal Specification

Egg collection race (Eierläset / Spring egg sprint) — Formal Specification

Switzerland · festival-ritual · Confidence: high

← Back to game page

Implementation Suitability

Suitability: engine-readyFidelity: discretizedGap-fills: 1
# Eierleset — AI-optimized specification ## General idea A dual-track asynchronous race game. Team A (Egg Gatherers) optimizes shuttle sprinting, throw-vs-carry decisions, and fragile object catching across 100 discrete egg stations. Team B (Distance Runners) paces a continuous cross-country progress bar. The match is a race against time between two fundamentally distinct physical task structures. ## Formal model - **Abstraction taken:** The 100 egg stations along the street are modeled as a 1D coordinate array xk=k⋅Δx (k∈[1,100], Δx=0.8 m). The overland cross-country course is modeled as a 1D continuous distance bar Drunner∈[0,Dtarget] (Dtarget=3000.0 m). - **Player/agent count:** 2 team agents (A=Gatherers, B=Runners). - **Turn model:** Synchronous real-time ticked execution (T=0.5 seconds per tick). ## Formal rules R1. Setup: 100 eggs placed at positions x1…x100. Collected egg count C=0. Runner position XR=0.0. R2. Gatherer Action per Egg k: - Gatherer sprinter runs to xk in time tout=xkvsprint. - Choice of return mode: 1. `carry_back`: Sprinter runs back to x=0 in time tback=xkvsprint. Egg safely added (C←C+1). Probability of break =0. 2. `toss_to_catcher`: Sprinter throws egg from xk to catcher at x=0. - Time cost =1.0 s (flight time). - Success probability P(catch)=max⁡(0.2,1.0−κtoss⋅xk). - If caught: Egg added (C←C+1). - If dropped: Egg breaks. Penalty time applied: gatherer must run to replacement pile and re-do station (tpenalty=2⋅tout+4.0 s). R3. Runner Progress: - At each tick, runner advances: ΔXR=vendurance⋅Δt. R4. Victory Conditions: - If C=100 while XR<Dtarget: Team A (Gatherers / Spring) wins immediately. - If XR≥Dtarget while C<100: Team B (Runners / Winter) wins immediately. R5. [gap-fill] Simultaneous Crossing: If the 100th egg is secured on the exact same tick that the runner crosses Dtarget, Team A (Spring) is awarded victory per traditional custom. ## Edge cases - **Tie at the end condition:** Handled by R5 (Spring priority rule). - **A player with no legal move:** Gatherer always chooses between `carry_back` and `toss`; runner continuously advances. - **Repetition / cycles:** Bounded by monotonic egg accumulation (C∈[0,100]) and runner distance progress (XR∈[0,3000] m). - **Simultaneous claims on the same resource or position:** Both teams operate on separate physical tracks. - **Player elimination mid-round; turn order repair:** No mid-race eliminations. - **Resource exhaustion:** Exactly 100 stations; race terminates on completion. - **Termination guarantee:** Monotonically increasing XR and non-decreasing C guarantee finite termination. ## State representation - **Persistent state:** Match winner ID, final elapsed time. - **Per-tick state:** Active egg index k∈[1,100], collected egg counter C∈[0,100], runner distance XR∈[0,3000], active gatherer sub-state (sprinting, tossing, penalty). - **Observable information:** Fully observable state. Both teams see the public egg count C and runner progress bar XR. ## Action space - `gather_egg(egg_id, mode)`: Mode ∈{CarryBack,TossToCatcher}. - `set_runner_pace(speed_ratio)`: Float p∈[0.8,1.2] (pacing vs fatigue trade-off). ## Playability notes - **Single-player-vs-AI:** Excellent optimization and risk-management challenge (computing the optimal threshold distance x∗ beyond which tossing becomes statistically superior to carrying). - **Group games (n>4):** Standard village team relay format. - **Physical-skill games:** Shuttle sprinting stamina and aerial raw egg catching are abstracted into speed and catch probability formulas. - **What is lost in the adaptation:** The splat of broken raw eggs on cobblestones, masked carnival dancers, and the smell of sizzling *Eiertätsch* omelettes. ## Implementation hints - Implement tick loop at 2 Hz (0.5s timestep). - Suggested first milestone: Implement deterministic carry-only baseline race before adding the stochastic toss-and-break penalty model.

Download as JSON

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

Download JSON
Cite this page

Egg collection race (Eierläset / Spring egg sprint) (Switzerland). (n.d.). Games of Countries. https://gamesofcountries.com/games/ch-switzerland/eierleset

@misc{gamesofcountries-ch-switzerland-eierleset,
  title = {Egg collection race (Eierläset / Spring egg sprint) (Switzerland)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/ch-switzerland/eierleset}
}