Formal Specification
Little Statues (Greek Red Light Green Light) — Formal Specification
Greece · chase-tag · Confidence: high
← Back to game pageImplementation Suitability
Suitability: engine-readyFidelity: discretizedGap-fills: 2
# Agalmatakia akounita — AI-optimized specification
## General idea
An asymmetric, stop-motion race game played on a 1D/2D distance track between one leader ("Mana") and several advancing runners. The leader executes variable-duration chanting cycles during which runners advance; when the chant ends, runners must instantaneously transition to a zero-velocity "statue" state. Over-stepping the turnaround or failing stochastic balance/laughter checks resets an agent to the baseline.
## Formal model
- **Abstraction taken:** Continuous running and bodily stillness discretized into distance positions (e.g. ) and velocity states. The leader's turnaround is a stochastic countdown .
- **Player/agent count:** 1 Leader agent () and Runner agents (, default ).
- **Turn model:** Round-based, subdivided into simultaneous discrete motion ticks during the chant, followed by an inspection evaluation phase.
## Formal rules
R1. Setup:
- Track length . All runners start at . Leader stands at .
R2. Chanting Phase:
- Leader samples chant length ticks and style .
- On each tick , each runner selects an acceleration/speed action . Position updates: .
R3. Turnaround / Freeze Event:
- At tick , the Leader turns around (`eyes_open = True`).
- Any runner with residual velocity (caught moving) is immediately penalized: .
R4. Statue Inspection Phase:
- Runners who achieved on time undergo an inspection stability check.
- [gap-fill] Freeze failure probability (twitching/laughing under inspection) is modeled as .
- If freeze check fails: Runner is reset to .
- If freeze check passes: Runner preserves current position for the next cycle.
R5. Win Condition & Role Transfer:
- First runner to reach without faulting wins the round immediately and becomes the Leader for the next round.
R6. [gap-fill] Maximum Cycles Cap: If no runner reaches within 25 full chant cycles, the runner closest to the finish line is declared winner.
## Edge cases
- Tie at the end condition: If multiple runners cross during the same chant cycle without faulting, the runner with the largest overshot position (furthest past finish) wins; if strictly equal, a 1-cycle tiebreaker sprint resolves the winner.
- A player with no legal move: Runners always have access to velocity choices .
- Repetition / cycles: Bounded by R6 (hard cap of 25 cycles).
- Simultaneous claims on the same resource or position: Runners track independent 1D coordinates along parallel lanes; lane collisions do not occur.
- Player elimination mid-round; turn order repair: Faulting runners reset to base rather than being eliminated; all agents remain active.
- Resource exhaustion: Not applicable — distance is an invariant metric.
- Termination guarantee: Non-zero forward progression combined with the cycle limit (R6) guarantees strict termination.
## State representation
- Persistent state:
- `runner_positions`: Array of integers .
- `cycle_count`: Integer .
- `leader_id`: Integer index.
- Per-tick ephemeral state:
- `t_remaining`: Remaining chant ticks in current cycle.
- `leader_facing`: Boolean (`True` = searching/observing, `False` = chanting/back turned).
- Observable information: Runners know current position and track length, but do not observe the exact secret tick value in advance (must infer via hazard rate).
## Action space
- `set_speed(v)`: .
- `choose_pose(stability)`: (Runner action) Select balance posture trading speed-damping for inspection safety.
## Playability notes
- Single-player-vs-AI: Highly playable as an optimal stopping / risk-management control problem under uncertainty.
- Group games (n>4): Easily handles 2 to 20 agents in parallel without state explosion.
- Physical-skill games: Physical balance and muscle control mapped onto deceleration timing and stochastic stability thresholds.
- What is lost: Physical acting, hilarious facial expressions, and live spoken jokes.
## Implementation hints
- Model runner policy as a dynamic programming / hazard-rate optimization problem balancing speed against the probability of turnaround at tick .
- Branching factor: 4 velocity choices per runner per tick.
Download as JSON
Download the full game corpus entry for this game as structured JSON.
Download JSONCite this page
Little Statues (Greek Red Light Green Light) (Greece). (n.d.). Games of Countries. https://gamesofcountries.com/games/gr-greece/agalmatakia-akounita
@misc{gamesofcountries-gr-greece-agalmatakia-akounita,
title = {Little Statues (Greek Red Light Green Light) (Greece)},
year = {n.d.},
publisher = {Games of Countries},
url = {https://gamesofcountries.com/games/gr-greece/agalmatakia-akounita}
}