Skip to main content
Formal Specification

Broken Telephone / Whispering Line — Formal Specification

North Macedonia · riddle-word · Confidence: low

← Back to game page

Implementation Suitability

Suitability: engine-readyFidelity: directGap-fills: 5
# Расипан телефон — AI-optimized specification ## General idea A sequential information-transmission game along a Markov chain of N agents. An initial text string S0 is generated at Agent 1 and passed strictly one-way from Agent i to Agent i+1 across a noisy transmission channel. The game evaluates total string preservation (Levenshtein distance / BLEU similarity) and identifies the transition point with maximum mutation. ## Formal model - **Abstraction taken:** Acoustic whispering and subjective phonetic misinterpretation are formalized as a discrete noisy character/token corruption channel 𝒯(S|η) where η represents phoneme substitution/insertion/deletion probability. - **Player/agent count:** N agents in a linear queue (N∈[5,20]). - **Turn model:** Strictly sequential pipeline (1→2→⋯→N). ## Formal rules R1. **Setup:** Agents ordered ⟨A1,A2…AN⟩. Originator A1 receives or generates target string S0∈Σ∗ (length L∈[15,60] chars). R2. **Transmission Sequence:** For i=1…N−1: - Agent Ai transmits private string Si−1 to Ai+1 via action `whisper_message(S)`. - The noisy channel transmits perceived string Si=𝒞(Si−1,ϵnoise) where each character undergoes substitution/deletion with probability ϵnoise=0.08. - Agent Ai+1 receives only Si; viewing Sk for k<i−1 is strictly prohibited (private local observation). R3. **Final Reveal & Evaluation:** - Terminal agent AN executes `announce_final_message(S_{N-1})`. - String similarity is computed using normalized Levenshtein distance: Score=max⁡(0,100⋅(1−Levenshtein(S0,SN−1)max⁡(|S0|,|SN−1|))) R4. [gap-fill] Fault Tracing Metric:** The transition point of maximum semantic drift is identified as i∗=arg⁡maxi∈[1,N−1]⁡Levenshtein(Si−1,Si). R5. [gap-fill] Two-Team Transmission Race:** When played competitively between two parallel chains TA and TB, the team with the higher terminal similarity Score wins the round. R6. [gap-fill] Single Whispering Constraint:** Each agent submits exactly one transmission; no confirmation queries or back-channel communication are permitted by the engine. ## Edge cases - Tie at the end condition: In two-team mode, if both teams achieve identical Levenshtein scores, the round is tied [gap-fill]. - A player with no legal move: Active agent in the pipeline always has legal `whisper_message(S)` action. - Repetition / cycles: Bounded; the pipeline advances strictly sequentially with N−1 transmissions, guaranteeing termination in exactly N steps. - Simultaneous claims on the same resource or position: Actions are strictly phased down the linear chain. - Player elimination mid-round; turn order repair: If an agent disconnects, their predecessor transmits directly to the successor, shortening the chain by 1 node. - Resource exhaustion: Message length is finite. - Termination guarantee: [gap-fill] Strictly guaranteed by the linear N-step pipeline. ## State representation - **Persistent state:** Number of players N, message history array ⟨S0,S1…SN−1⟩, team scores. - **Per-step ephemeral state:** Active sender index i∈[1,N−1], transmitted string Si. - **Observable information:** Imperfect information; agent Ai legitimately observes only incoming message Si−1 and outgoing message Si. Full history is revealed only after AN announces the terminal string. ## Action space - `whisper_message(msg_string)`: Submits string to successor Ai+1. Precondition: caller is the active receiver in queue. - `announce_final_message(msg_string)`: Terminal broadcast by AN. ## Playability notes - Single-player-vs-AI: Playable in an AI pipeline where human is one node in the chain trying to decode noisy phonemes. - Group games (n>4): Natively accommodates large agent groups (5..20) along the linear transmission graph. - Physical-skill games: Acoustic whispering volume and auditory decoding are abstracted into string perturbation models. - What is lost in the adaptation: The hilarious facial expressions of confusion when hearing garbled syllables and the explosive group laughter during the final reveal. ## Implementation hints Very low complexity. Straightforward array passing with character substitution/noise functions and standard Levenshtein distance metrics. First milestone: verify N-agent pipeline execution and similarity score computation.

Download as JSON

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

Download JSON
Cite this page

Broken Telephone / Whispering Line (North Macedonia). (n.d.). Games of Countries. https://gamesofcountries.com/games/mk-north-macedonia/rasipan-telefon

@misc{gamesofcountries-mk-north-macedonia-rasipan-telefon,
  title = {Broken Telephone / Whispering Line (North Macedonia)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/mk-north-macedonia/rasipan-telefon}
}