Skip to main content
Formal Specification

Rotten Egg — Formal Specification

Slovenia · singing-circle · Confidence: low

← Back to game page

Implementation Suitability

Suitability: engine-readyFidelity: discretizedGap-fills: 2
# Gnilo jajce — AI-optimized specification ## General idea A synchronous spatial circle game modeled on a discrete ring graph where a perimeter runner secretly drops a token behind a seated agent. The target agent must detect the drop through periodic observation ticks and initiate a chase race around the ring before the runner completes a full lap to inflict a penalty. ## Formal model - **Abstraction taken:** The sitting circle is discretized into a ring graph CN−1 with nodes 0,1,…,N−2 and a central penalty node ccenter. The runner moves along continuous perimeter coordinates θ∈[0,2π). Seated agents sample tactile/auditory detection checks per time step. - **Player/agent count:** N agents (A0…AN−1, with N≥6, standard N=8). - **Turn model:** Real-time ticked simulation with two phases: (1) Perimeter Walk & Secret Drop, (2) Chase or Penalty Resolution. ## Formal rules R1. Setup: N−1 agents occupy sitting nodes k∈{0,…,N−2} arranged at angles θk=2πkN−1. Active runner Arunner starts at θ=0 holding token. R2. Walk & Secret Drop: - Arunner moves around perimeter at speed vwalk. - At some node k∗, Arunner executes `drop_token(k^*)`. - Token location becomes postoken=k∗. R3. Detection Model: - On each discrete tick Δt=0.2 s while token rests at node k∗: - Seated agent Atarget (at k∗) performs detection test: P(detect)=λvigilance⋅Δt. - If detected at time tdet before runner completes full circuit (θrunner<θk∗+2π): - Chase begins immediately. - If runner completes full lap (θrunner≥θk∗+2π) without detection: - Penalty triggers: Atarget is assigned state `is_rotten = True` and moved to ccenter. Arunner retains role and starts R2. R4. Chase & Seat Race: - If detected, Atarget vacates seat k∗ and chases Arunner along the perimeter. - [gap-fill] Arrival time comparison: - Runner travel time to vacant seat: trunner=d(posrunner,k∗)vsprint,runner. - Chaser tag time: ttag=d(k∗,posrunner)vsprint,chaser−vsprint,runner+τreact. - If trunner<ttag: Arunner occupies seat k∗; Atarget becomes the new runner. - If ttag≤trunner: Runner is tagged; original Arunner remains runner for next round. R5. Match Termination: - [gap-fill] Game runs for M=10 rounds. The agent with the fewest rounds spent as runner or in the center penalty node wins. ## Edge cases - Tie at the end condition: Equal tag and seat arrival times are resolved in favor of the seated defender. - A player with no legal move: Seated players passively sample detection; runner must drop token within 2 laps. - Repetition / cycles: Bounded by finite M=10 round horizon. - Simultaneous claims on the same resource or position: Token drop can only occur at one discrete node at a time. - Player elimination mid-round; turn order repair: If an agent in the ring disconnects, ring size decreases to N−2; angular positions re-index. - Resource exhaustion: A single token is passed invariant across rounds. - Termination guarantee: Strict termination guaranteed by M-round cap. ## State representation - Persistent state: `seat_nodes: list[int]`, `runner_id: int`, `center_rotten_ids: list[int]`, `round_index: int`. - Ephemeral round state: `token_node: Optional[int]`, `runner_theta: float`, `is_detected: bool`, `chase_active: bool`. - Observable information: Runner angular coordinate is public; token drop event is hidden from seated agents until probabilistic detection fires. ## Action space - `move_runner(angular_velocity: float)`: Perimeter traversal. - `drop_token(seat_index: int)`: Secret drop action. - `sprint_chase()`: Chaser acceleration action upon detection. ## Playability notes - Single-player-vs-AI: Natural; human plays as seated agent managing vigilance timing or as runner picking optimal target angles. - Group games (n>4): Natively designed for 6 to 15 agents. - Physical-skill games: Tactile awareness and reaction time modeled as Poisson detection rate λ and sprint speeds. - What is lost: Subtlety of sly backward glances, cloth touch against the back. ## Implementation hints Ring graph topology with continuous perimeter runner angle. First milestone: implement deterministic drop-and-chase race before adding Poisson detection latency.

Download as JSON

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

Download JSON
Cite this page

Rotten Egg (Slovenia). (n.d.). Games of Countries. https://gamesofcountries.com/games/si-slovenia/gnilo-jajce

@misc{gamesofcountries-si-slovenia-gnilo-jajce,
  title = {Rotten Egg (Slovenia)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/si-slovenia/gnilo-jajce}
}