Skip to main content
Formal Specification

The Pumpkin Game (Greek Rhythmic Number Dialogue) — Formal Specification

Greece · riddle-word · Confidence: high

← Back to game page

Implementation Suitability

Suitability: engine-readyFidelity: directGap-fills: 1
# Kolokythia — AI-optimized specification ## General idea A discrete, turn-based dialogue and working memory elimination game. Agents maintain an active roster of valid agent numbers and execute a fixed, three-step call-and-response protocol under strict timing constraints. An agent is eliminated upon hesitating beyond a dynamic response threshold, calling an eliminated agent number, calling their own number, or failing an execution check. ## Formal model - **Abstraction taken:** Rapid Greek tongue-twisting speech and rhythmic meter are modeled as a discrete turn-response deadline τdeadline (in milliseconds) and a stochastic pronunciation/memory failure check Pstumble=f(tempo,memory_load). - **Player/agent count:** N agents (indexed 1..N, N∈[3..8], default N=5). - **Turn model:** Strictly sequential dialogue chain with dynamic speaker assignment. ## Formal rules R1. Setup: - Active set 𝒜={1,2,…,N}. - Turn tempo Δt=1.0 second (decreases by 0.05s per elimination). - Initial caller C=1. Initial target T∈𝒜∖{C}. R2. Protocol Exchange Steps: - Step 1 (Challenge): Caller C outputs `ask(T)`: "Why should it make T?". - Step 2 (Response): Target T must respond with `counter()`: "How many should it make?" within Δt. - Step 3 (Redirection): Caller C outputs `nominate(T')` where T′∈𝒜∖{C,T}. - Step 4 (Handoff): Target T becomes the new Caller C←T, and targets T←T′. The loop repeats from Step 1. R3. Elimination Criteria: - An agent is immediately removed from 𝒜 if: 1. Response latency t>Δt (Hesitation / Timeout). 2. Called target T∉𝒜 (Calling an eliminated agent or non-existent index). 3. Called target T==Self (Calling oneself). 4. [gap-fill] Execution error: With probability Pslip=0.05×(1.0/Δt)×(1.0−skilli), agent incurs a verbal slip and is eliminated. R4. Post-Elimination Repair: - If active caller C or target T is eliminated, the lowest-indexed remaining agent in 𝒜 becomes the new caller C, and randomly selects T∈𝒜∖{C} to restart the dialogue. - Tempo accelerates: Δt←max⁡(0.20,Δt−0.05). R5. Win Condition: - When |𝒜|==1, the sole remaining agent is declared the winner. ## Edge cases - Tie at the end condition: Not applicable — eliminations occur sequentially on discrete speaking turns until exactly 1 agent survives. - A player with no legal move: Not applicable — if |𝒜|≥2, at least one valid target T′∈𝒜∖{self} always exists. - Repetition / cycles: Bounded — non-zero slip probability Pslip>0 and shrinking response windows Δt→0.20 guarantee that eliminations occur at a geometric rate. - Simultaneous claims on the same resource or position: Not applicable — dialogue chain is strictly single-speaker sequential. - Player elimination mid-round; turn order repair: Handled cleanly by R4. - Resource exhaustion: Set 𝒜 monotonically shrinks from N to 1. - Termination guarantee: Monotonic reduction of |𝒜| ensures termination in at most N−1 elimination events. ## State representation - Persistent state: - `active_set`: Set of surviving integers 𝒜⊆{1..N}. - `caller_id`: Integer C∈𝒜. - `target_id`: Integer T∈𝒜. - `current_tempo`: Float Δt. - `round_count`: Integer counter. - Observable information: Full history of eliminated numbers and active set 𝒜 is public knowledge. ## Action space - `respond()`: Emitted by target agent T within Δt. - `nominate(next_target)`: Emitted by caller C, where `next_target` ∈{1..N}. ## Playability notes - Single-player-vs-AI: Highly playable as a working memory and reaction-speed benchmark game. - Group games (n>4): Plays identically with N=3..15 agents; larger groups increase memory retrieval load. - Physical-skill games: Verbal fluency and speech rhythm mapped to reaction deadlines and stochastic slip rates. - What is lost: Comedic voice modulation, breathless laughter, and tongue-tied giggles. ## Implementation hints - Pure state-machine implementation with timer events. - Branching factor for caller nomination is |𝒜|−2.

Download as JSON

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

Download JSON
Cite this page

Kolokythia (Greece). (n.d.). Games of Countries. https://gamesofcountries.com/games/gr-greece/kolokythia

@misc{gamesofcountries-gr-greece-kolokythia,
  title = {Kolokythia (Greece)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/gr-greece/kolokythia}
}