Formal Specification
Emperor, Emperor, Master, What Time Is It? — Formal Specification
North Macedonia · chase-tag · Confidence: low
← Back to game pageImplementation Suitability
Suitability: engine-readyFidelity: discretizedGap-fills: 3
# Царе, царе, господаре — AI-optimized specification
## General idea
A discrete 1D race and pacing game. One agent acts as Emperor at coordinate , while runner agents advance along the line . Runners sequentially query the Emperor, who issues discrete step commands (Giant, Normal, Ant, Crab). The first runner whose position reaches wins and becomes the Emperor.
## Formal model
- **Abstraction taken:** The physical running space is discretized into a 1D integer track of length units. Step commands translate into discrete integer displacement vectors : Giant (), Normal (), Ant (), Umbrella (), Crab ().
- **Player/agent count:** 1 Emperor () and runners (), .
- **Turn model:** Sequential cyclic turn order among runners; each turn consists of a query command movement execution.
## Formal rules
R1. **Track Setup:** Track length . All runners initialized at position for . Emperor located at .
R2. **Step Definitions:**
- `Giant`:
- `Normal`:
- `Umbrella`:
- `Ant`:
- `Crab`:
R3. **Turn Progression:** On runner 's turn:
- submits `query_time()`.
- Emperor submits `issue_command(step_type, count)` where and .
- Runner position updates: .
R4. [gap-fill] Emperor Fairness Constraint:** The Emperor agent cannot issue negative (`Crab`) commands to the same runner more than 2 consecutive times.
R5. **Fault Check:** Runners execute movement with execution fidelity . If an execution fault occurs (simulating stepping error), (reset to start line).
R6. **Win Condition:** As soon as any runner's position reaches , that runner wins the round immediately and becomes Emperor for the next round.
R7. [gap-fill] Maximum Turns Cap:** A round is capped at total steps. If no runner reaches , the runner closest to wins.
## Edge cases
- Tie at the end condition: Not applicable; runners take individual sequential turns, so exactly one runner crosses first.
- A player with no legal move: Runners always submit `query_time()`, and Emperor always selects from valid step commands.
- Repetition / cycles: Bounded; forward step types yield strictly positive velocity on average, and R7 enforces a hard step cap.
- Simultaneous claims on the same resource or position: Track positions permit multiple runners at the same coordinate .
- Player elimination mid-round; turn order repair: If an agent disconnects, they are removed from the runner queue without affecting others.
- Resource exhaustion: Track distance is fixed and non-depletable.
- Termination guarantee: [gap-fill] Guaranteed by average positive drift toward and the hard turn cap.
## State representation
- **Persistent state:** Number of runners , track length , active Emperor ID, total rounds played.
- **Per-turn ephemeral state:** Runner positions , active runner index , issued command .
- **Observable information:** Fully observable; all runner positions and Emperor commands are public.
## Action space
- `query_time()`: Submits request to Emperor on active runner turn.
- `issue_command(step_type, count)`: Parameters , . Precondition: caller is Emperor.
## Playability notes
- Single-player-vs-AI: Playable as a runner trying to maximize forward progress or as Emperor managing runner handicaps.
- Group games (n>4): Natively accommodates 4 to 15 players in cyclic turn queues.
- Physical-skill games: Physical balance and stepping length are discretized into fixed integer movements.
- What is lost in the adaptation: The comical mimicry of spinning umbrella jumps, ant heel-to-toe wobbling, and children's lively vocal cadence.
## Implementation hints
Very low complexity. Requires a simple 1D coordinate array and a 2-step request-response state machine per turn. First milestone: implement R1–R6 and verify that runners advance toward under simulated Emperor commands.
Download as JSON
Download the full game corpus entry for this game as structured JSON.
Download JSONCite this page
Emperor, Emperor, Master, What Time Is It? (North Macedonia). (n.d.). Games of Countries. https://gamesofcountries.com/games/mk-north-macedonia/care-care-gospodare
@misc{gamesofcountries-mk-north-macedonia-care-care-gospodare,
title = {Emperor, Emperor, Master, What Time Is It? (North Macedonia)},
year = {n.d.},
publisher = {Games of Countries},
url = {https://gamesofcountries.com/games/mk-north-macedonia/care-care-gospodare}
}