Skip to main content
Formal Specification

Sugar, Coffee, Lemonade (Czech Red Light, Green Light) — Formal Specification

Czechia · chase-tag · Confidence: high

← Back to game page

Implementation Suitability

Suitability: engine-readyFidelity: discretizedGap-fills: 2
# Cukr, káva, limonáda — AI-optimized specification ## General idea A stop-and-go race along a 1D track where runner agents balance forward movement velocity against deceleration time to ensure complete stillness when a caller agent completes an audio-timed verbal cadence and inspects the track. ## Formal model - **Abstraction taken:** Track discretized to a 1D continuous corridor of length L=20.0 meters, starting at x=0 and finishing at x=L where Caller stands. Movement during the call is modeled via chosen runner speeds vi∈[0,vmax] and deceleration time Δtstop=vi/abrake. - **Player/agent count:** 1 Caller agent C, n Runner agents R1..Rn (n≥2, standard n=4). - **Turn model:** Synchronous phase cycles (Call Phase → Freeze Inspection Phase). ## Formal rules R1. Setup: Runners initialize at xi=0. Caller position xC=L. Track length L=20.0. R2. Call phase duration: - Caller agent chooses recitation duration Tcall∈[1.5,4.0] seconds (simulating modulation of *"Cukr, káva, limonáda, čaj, rum, bum"*). - Caller cannot observe runner positions during Tcall. R3. Runner movement commitment: - Each Runner agent i chooses running velocity vi∈[0,5.0] m/s and sprint duration trun,i∈[0,4.0] seconds. - Effective advance Δxi=vi×min⁡(trun,i,Tcall). - Actual position updates to xi′=min⁡(L,xi+Δxi). R4. Freeze & Motion check: - Stopping time required is tstop,i=trun,i+(vi/4.0). - If tstop,i>Tcall, the runner failed to achieve stillness before Caller turned around. - [gap-fill] Execution jitter: With probability Pjitter=0.05×vi, a runner who barely stopped also trips the motion sensor. R5. Penalty resolution: - If Runner i is detected moving (tstop,i>Tcall or jitter triggered), Runner i is penalized: xi resets to 0. R6. Win condition: The first runner i to reach xi≥L without incurring a motion penalty in that cycle wins the round and is designated Caller for the next round. R7. [gap-fill] Round cycle cap: If 25 cycles elapse without a winner, the runner currently closest to L is declared the winner. ## Edge cases - Tie at the end condition: If multiple runners cross x≥L in the same cycle, the runner with the largest margin beyond L (xi−L) wins. - A player with no legal move: Holding position (vi=0) is always legal. - Repetition / cycles: Bounded by R7 maximum 25-cycle cap. - Simultaneous claims on the same resource: Multiple runners may share identical x coordinates without collision penalty. - Player elimination mid-round: If a runner disconnects, they are removed from the track; race continues with remaining agents. - Resource exhaustion: Distance is bounded [0,L]; no consumable tokens. - Termination guarantee: Monotonic progress tendencies ensure crossing L, bounded strictly by R7. ## State representation - Persistent state: `runner_positions: list[float]`, `round_number: int`, `caller_id: int`, `cycle_count: int`. - Ephemeral cycle state: `caller_duration: float`, `runner_actions: list[tuple[float, float]]`, `detected_violators: list[int]`. - Observable information: - Caller observes: `detected_violators` only at the end of Tcall; does not observe live trun choices during the call. - Runners observe: Their own position xi, history of caller durations in past cycles Tˆcall. ## Action space - Caller: `set_call_duration(duration: float)` with duration∈[1.5,4.0]. - Runner: `choose_sprint(velocity: float, sprint_time: float)` with velocity∈[0.0,5.0], sprint_time∈[0.0,4.0]. ## Playability notes - Single-player-vs-AI: Natural; human plays as a runner timing sprints against stochastic AI caller variations, or plays Caller trying to catch AI runners. - Group games (n>4): Easily scales to 10+ runners. - Physical-skill games: Dynamic balance and sprint deceleration are mapped to the kinematic braking equation tstop=trun+v/a. - What is lost: Visual comedy of contorted statue poses and real-world subtle twitch detection. ## Implementation hints Low complexity. The core is an asymmetric timing game (Caller picks T, Runner estimates T and picks (v,t) to maximize Δx while ensuring t+v/a≤T). First milestone: simulate 1 Runner vs. 1 Caller over 10 cycles.

Download as JSON

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

Download JSON
Cite this page

Sugar, Coffee, Lemonade (Czech Red Light, Green Light) (Czechia). (n.d.). Games of Countries. https://gamesofcountries.com/games/cz-czechia/cukr-kava-limonada

@misc{gamesofcountries-cz-czechia-cukr-kava-limonada,
  title = {Sugar, Coffee, Lemonade (Czech Red Light, Green Light) (Czechia)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/cz-czechia/cukr-kava-limonada}
}