Skip to main content
Formal Specification

Sugar, Coffee, Tea, Rum, Boom! (Slovak Red Light, Green Light) — Formal Specification

Slovakia · chase-tag · Confidence: low

← Back to game page

Implementation Suitability

Suitability: engine-readyFidelity: discretizedGap-fills: 4
# Cukor, káva, čaj, rum, bum — AI-optimized specification ## General idea A dynamic risk-management race game where a Caller agent modulates the duration and speech-cadence of a verbal timer (Tphrase∈[1.0,4.0] s) before instantly observing the field, while Runner agents choose an acceleration curve that balances distance covered against the probability of overshooting the freeze-window and triggering a full spatial reset. ## Formal model - **Abstraction taken:** The 1D track of length L=30.0 meters is discretized into continuous distance x∈[0,30]. The Caller chooses a recitation duration T∼[Tmin⁡,Tmax⁡] and a deceleration abruptness parameter. Each Runner agent chooses a run duration trun≤T. If a Runner is still decelerating (trun+tbrake>T), motion is detected with probability P(detected)=f(vresidual). - **Player/agent count:** 1 Caller, N Runners (N∈[2,15]). - **Turn model:** Repeated synchronous cycles (Phrase Call → Sprint & Brake → Scan & Reset → State Update). ## Formal rules R1. Setup: Goal line is at x=30.0. Runners start at x=0.0. Caller is positioned at x=30.0. R2. Caller Action: The Caller secretly selects a speech duration T∈[1.0,4.0] seconds [gap-fill] and turns their back. R3. Runner Action: Each Runner i chooses an intentional sprint duration ti∈[0.5,4.5] s and a target velocity vi∈[2.0,6.0] m/s. R4. Kinematic Resolution: - Distance advanced: Δxi=vi×min⁡(ti,T). - Braking time: tbrake,i=vi/amax, where maximum deceleration amax=4.0 m/s2 [gap-fill]. - Total motion end timestamp: tstop,i=ti+tbrake,i. R5. Scan Phase: At timestamp T, the Caller turns. - If tstop,i>T: Residual velocity vres=vi−amax(T−ti)>0. - Detection probability P(detected)=min⁡(1.0,vres/1.0). - If detected: Runner i is reset to xi=0.0. - If not detected (or tstop,i≤T): Runner i secures their new position xi←xi+Δxi. R6. Win condition: The first Runner to reach xi≥30.0 without being detected wins the round and becomes the new Caller. R7. Round timeout: If no runner reaches 30.0 m after 20 cycles, the runner with maximum xi wins [gap-fill]. ## Edge cases - Tie at the end condition: If multiple runners cross x≥30.0 in the same cycle without detection, the runner with the largest xi wins; if equal, a 5-meter sudden sprint decides the winner [gap-fill]. - A player with no legal move: Runners can always choose vi=0 (staying still). - Repetition / cycles: Maximum 20 cycles guarantees termination. - Simultaneous claims on the same resource or position: Runners track independent 1D scalar positions without collision blocking. - Player elimination mid-round; turn order repair: Detected runners are not eliminated; their position is reset to x=0. - Resource exhaustion (pieces, tokens, space, time): Track length is fixed (30m); cycle count is bounded (20). - Termination guarantee: Deterministic upper bound of 20 cycles ensures exact termination. ## State representation - Persistent state: `cycle: int (1..20)`, `runner_positions: dict[int, float]`, `caller_id: int`, `scores: dict[int, int]`. - Per-cycle ephemeral state: `chosen_phrase_duration: float`, `runner_sprint_plans: dict[int, tuple[float, float]]`, `detected_mask: dict[int, bool]`. - Observable information: Runners do not observe T during sprint selection; past cycle durations of the Caller can be tracked for Bayesian estimation. Positions are public after each scan. ## Action space - `caller_speak(duration: float)`: Choose phrase length T∈[1.0,4.0]. - `runner_sprint(duration: float, target_speed: float)`: Choose sprint time t∈[0.5,4.5] and speed v∈[2.0,6.0]. ## Playability notes - Single-player-vs-AI: Exceptional risk/bluff game; human can play as Runner trying to predict AI Caller cadence, or as Caller attempting to randomize speech tempo to catch AI runners. - Group games (n>4): Scales smoothly from 2 to 15 runners without algorithmic overhead. - Physical-skill games: Neuromuscular deceleration and freeze reaction are elegantly captured by kinematic braking formulas. - What is lost in the adaptation: Physical wobbling, laughter, dramatic bodily statue poses, and subtle physical eye tracking. ## Implementation hints Low complexity. The entire engine is a simple kinematic equation loop. First milestone: build a 1-Caller vs 2-Runner simulation validating that conservative runners advance slowly while reckless runners frequently get reset.

Download as JSON

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

Download JSON
Cite this page

Sugar, Coffee, Tea, Rum, Boom! (Slovak Red Light, Green Light) (Slovakia). (n.d.). Games of Countries. https://gamesofcountries.com/games/sk-slovakia/cukor-kava-caj-rum-bum

@misc{gamesofcountries-sk-slovakia-cukor-kava-caj-rum-bum,
  title = {Sugar, Coffee, Tea, Rum, Boom! (Slovak Red Light, Green Light) (Slovakia)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/sk-slovakia/cukor-kava-caj-rum-bum}
}