Skip to main content
Formal Specification

The Pešek Goes Around (Drop the Handkerchief / Switch) — Formal Specification

Czechia · singing-circle · Confidence: low

← Back to game page

Implementation Suitability

Suitability: engine-readyFidelity: discretizedGap-fills: 2
# Chodí pešek okolo — AI-optimized specification ## General idea A synchronous singing-circle spatial game modeled on a discrete ring graph where a perimeter runner agent selects a target sitting agent at the culmination of a metric chant. Both agents then engage in a simultaneous bidirectional sprint around the ring to claim the single open seat. ## Formal model - **Abstraction taken:** The sitting circle is discretized into a ring graph CN with N−1 sitting node positions 0,1,…,N−2. The runner moves along outer continuous arc coordinates θ∈[0,2π). Sprint travel time around the perimeter is modeled via agent sprint velocities and reaction latencies. - **Player/agent count:** N agents (A0…AN−1, with N≥5, standard N=8). - **Turn model:** Two-step round structure: (1) Metric Chant & Target Selection; (2) Bidirectional Sprint Race. ## Formal rules R1. Setup: Ring of N−1 seats arranged at angles θk=2πkN−1 for k∈{0,…,N−2}. Agent Apesek is initialized at angle θ=0. N−1 agents occupy the N−1 seats. R2. Chanting & Target selection: - Chant duration lasts Tchant=12 discrete beats. - During beats 1..11, Apesek moves around the perimeter at constant walking velocity vwalk. - At beat 12, Apesek selects a target seated agent Atarget located at seat index k∗. R3. Bidirectional Sprint Race: - Seated agent Atarget vacates seat k∗. - Apesek sprints toward seat k∗ in the clockwise direction; travel distance is dpesek. - Atarget sprints toward seat k∗ in the counter-clockwise direction (covering the full perimeter 2πR−dpesek) or vice versa. - [gap-fill] Sprint arrival times: - tpesek=dpesekvpesek+ϵpesek - ttarget=2πR−dpesekvtarget+τreact+ϵtarget, where τreact∈[0.2,0.5] s is reaction latency to being tapped. R4. Seat Allocation & Role Transition: - If tpesek<ttarget: Apesek occupies seat k∗. Atarget becomes the new Apesek for the subsequent round. - If ttarget≤tpesek: Atarget reclaims seat k∗. Original Apesek remains Apesek for the next round. R5. Match structure and Termination: - [gap-fill] Match runs for M=10 rounds. - The agent who spent the fewest total rounds in the Apesek role is declared the winner. ## Edge cases - Tie at the end condition: Equal arrival times at seat k∗ award the seat to the defender Atarget. - A player with no legal move: Addressed by compulsory target selection k∗∈{0,…,N−2} by Apesek. - Repetition / cycles: Bounded by finite M=10 round limit. - Simultaneous claims on the same resource: Explicitly resolved by arrival timestamp comparison (tpesek vs. ttarget). - Player elimination mid-round: If a sitting agent disconnects, ring size decreases to N−2; game continues. - Resource exhaustion: Fixed ring geometry invariant across rounds. - Termination guarantee: Strict termination guaranteed by finite M-round cap. ## State representation - Persistent state: `seat_assignments: list[int]`, `pesek_id: int`, `round_number: int`, `pesek_round_counts: dict[int, int]`. - Ephemeral round state: `chosen_target_id: int`, `arrival_times: tuple[float, float]`. - Observable information: Fully observable (all positions, runner angle, and times are public). ## Action space - `select_target_seat(seat_index: int)`: Chosen by Apesek at beat 12 (seat_index∈[0,N−2]). ## Playability notes - Single-player-vs-AI: Natural; human plays as Apesek choosing strategic targets with favorable distance/reaction trade-offs, or plays as sitting agent reacting to tap. - Group games (n>4): Natively designed for 6–15 agents. - Physical-skill games: Peripheral audio tracking and sudden sprint acceleration are mapped to reaction delay τreact and velocity parameters. - What is lost: Physical tactile cloth drop and covert backward glances. ## Implementation hints Low complexity. The core logic reduces to a single target selection step followed by a continuous race time comparator. First milestone: 6 agents on a circular graph with deterministic sprint calculations.

Download as JSON

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

Download JSON
Cite this page

The Pešek Goes Around (Drop the Handkerchief / Switch) (Czechia). (n.d.). Games of Countries. https://gamesofcountries.com/games/cz-czechia/chodi-pesek-okolo

@misc{gamesofcountries-cz-czechia-chodi-pesek-okolo,
  title = {The Pešek Goes Around (Drop the Handkerchief / Switch) (Czechia)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/cz-czechia/chodi-pesek-okolo}
}