Formal Specification
Emperor, Emperor, What Time Is It? — Formal Specification
Serbia · chase-tag · Confidence: low
← Back to game pageImplementation Suitability
Suitability: engine-readyFidelity: discretizedGap-fills: 2
# Care, care, gospodare — AI-optimized specification
## General idea
A turn-based 1D position race with hidden identity deduction. `N-1` Petitioners race along a 1D track from `x = 0` toward the Emperor at `x = L`. On each turn, a Petitioner requests steps while disguising their identity; the Emperor attempts to deduce who is asking and assigns step counts and types to maximize distance from front-runners while advancing laggards. The first Petitioner to reach `x >= L` wins and becomes the new Emperor.
## Formal model
- **Abstraction taken:** The 10–15m track is discretized into a 1D coordinate `x \in [0, L]` where . Animal steps are converted to discrete integer movement values :
- Ant step (`ANT`):
- Cat step (`CAT`):
- Horse leap (`HORSE`):
- Backward step (`BACK`):
- **Player/agent count:** agents (1 Emperor, Petitioners).
- **Turn model:** Sequential round-robin questioning by Petitioners, followed by the Emperor's command and position update.
## Formal rules
R1. Initialization: Emperor is Agent 0. Petitioners are Agents . Track length . Positions initialized: `pos[i] = 0` for all .
R2. Question & Voice Disguise:
- Active petitioner submits an inquiry to the Emperor along with a vocal disguise parameter `disguise \in [0.0, 1.0]`.
- The Emperor receives a noisy acoustic observation `obs = (identity_i + Normal(0, sigma_voice * disguise))`.
R3. Emperor Command:
- The Emperor outputs an assigned movement command `(step_type, count)` where:
- `step_type \in {ANT, CAT, HORSE, BACK}`
- `count \in {1, 2, 3}`.
- Resulting displacement .
R4. Movement Update:
- Petitioner 's position updates: `pos[i] = max(0, min(L, pos[i] + \Delta x))`.
R5. Win Condition:
- If `pos[i] >= L`, Petitioner touches the Emperor, wins the round immediately, and is assigned the Emperor role for the next game.
R6. [gap-fill] Round Cap: If no petitioner reaches within rounds, the petitioner closest to is declared the winner and becomes Emperor.
## Edge cases
- Tie at the end condition: If multiple petitioners reach during the same round of questioning, the first petitioner who touched in turn sequence is the winner.
- A player with no legal move: Not applicable; Emperor always has valid step assignments; petitioners always execute movements.
- Repetition / cycles: Bounded by R6's 30-round limit.
- Simultaneous claims on the same resource or position: Track allows multiple petitioners to occupy identical discrete coordinates .
- Player elimination mid-round / turn order repair: [gap-fill] If a petitioner disconnects, they are removed from the rotation; Emperor role remains unaffected.
- Resource exhaustion: Not applicable; coordinate space is bounded .
- Termination guarantee: Guaranteed by monotonic forward drift of standard positive steps combined with R6 round cap.
## State representation
- Persistent state: `emperor_id: AgentID`, `scores: dict[AgentID, int]`, `round_count: int`.
- Per-turn state: `positions: dict[AgentID, int]`, `active_petitioner: int`, `emperor_belief: dict[AgentID, float]`.
- Observable information:
- Petitioners observe: all public positions `pos[1..N-1]`, track length .
- Emperor observes: noisy audio signal `obs` (does not see who is actively speaking, but knows all current positions).
## Action space
- `ask_time(disguise_effort: float)`: Petitioner action.
- `command_steps(step_type: enum[ANT, CAT, HORSE, BACK], count: int)`: Emperor action.
## Playability notes
- Single-player-vs-AI: Highly playable; human player as Emperor infers speaker identities from game situation, or as Petitioner uses optimal bluffing strategies.
- Group games (n>4): Natively supports 3 to 10 agents.
- Physical-skill games: Motor balance and vocal imitation are mapped to discrete step values and Gaussian observation noise.
- What is lost in the adaptation: The physical humor of children stumbling on heel-to-toe "ant steps" or leaping across grass is replaced by integer additions.
## Implementation hints
Simple 1D race engine with a hidden Markov/Bayesian inference layer for the Emperor agent. First milestone: implement deterministic position updates with random Emperor commands.
Download as JSON
Download the full game corpus entry for this game as structured JSON.
Download JSONCite this page
Emperor, Emperor, What Time Is It? (Serbia). (n.d.). Games of Countries. https://gamesofcountries.com/games/rs-serbia/care-care-gospodare
@misc{gamesofcountries-rs-serbia-care-care-gospodare,
title = {Emperor, Emperor, What Time Is It? (Serbia)},
year = {n.d.},
publisher = {Games of Countries},
url = {https://gamesofcountries.com/games/rs-serbia/care-care-gospodare}
}