Skip to main content
Formal Specification

Drop the Handkerchief — Formal Specification

Netherlands · singing-circle · Confidence: low

← Back to game page

Implementation Suitability

Suitability: engine-readyFidelity: discretizedGap-fills: 5
# Zakdoekje leggen — AI-optimized specification ## General idea A cyclic ring game with hidden token placement and a perimeter sprint chase. A single runner circles a discrete ring of seated agents during a fixed-length song phase, secretly dropping a token behind one target. The target must detect the drop, initiate pursuit, and tag the runner before the runner completes the circuit to claim the vacated seat. ## Formal model - **Abstraction taken:** Circle of N seated players is discretized into a directed 1D ring graph C=(V,E) with |V|=N nodes indexed 0..N−1. Time is discretized into ticks: Phase 1 (Song/Drop, T1=10 ticks) and Phase 2 (Sprint Chase, T2≤10 ticks). - **Player/agent count:** N agents (N∈[6,20]). Exactly 1 runner R, and N−1 seated agents S0..SN−2. - **Turn model:** Phase 1: sequential / discrete walking ticks for runner; Phase 2: simultaneous sprint movement ticks for runner and chaser. ## Formal rules R1. **Ring setup:** N positions 0..N−1 on a ring graph. N−1 agents are seated at positions 0..N−2. Position N−1 is the runner's initial vacant slot. R2. **Phase 1 — Drop Phase:** Lasts exactly Tsong=10 ticks. - Each tick, the runner advances +1 node along the ring: posR←(posR+1)modN. - During ticks 1..10, the runner executes exactly once: `drop_token(target_node)` behind the adjacent seated agent [gap-fill]. R3. **Detection check:** At tick Tsong, or whenever the token is dropped, the target seated agent k performs a detection check: P(detect)=1.0−0.1⋅(Tsong−tdrop) If undetected by Tsong+3, the target agent is caught unaware (*in de pot*) [gap-fill]. R4. **Phase 2 — Chase Phase:** - The target agent C becomes the active chaser, standing up from posC. posC is now marked as the vacant target seat Vtarget. - In each tick t∈[1,10], runner R and chaser C simultaneously choose movement speed: vR,vC∈{1,2} cells/tick. R5. **Tag Resolution:** - If posC==posR (or paths cross in the same tick), the runner is tagged: chaser wins, runner remains runner for next round. - If posR==Vtarget and runner is untagged: runner claims seat, becoming seated; chaser becomes new runner. R6. **Round termination:** A round terminates immediately upon a tag, successful seating, or timeout (t>10 ticks, resolving as runner caught) [gap-fill]. ## Edge cases - **Tie at the end condition:** If runner reaches Vtarget on the exact same tick that chaser catches runner, tag check takes strict precedence (runner is tagged) [gap-fill]. - **A player with no legal move:** Not applicable; movement choices are always available. - **Repetition / cycles:** Bounded by strict tick caps (Tsong=10, Tchase≤10). - **Simultaneous claims on the same resource or position:** Evaluated via rule R5 (tag resolution precedes seat lock-in). - **Player elimination mid-round; turn order repair:** An agent sent "in de pot" is placed in a center penalty pool; the outer ring shrinks to N−1 nodes [gap-fill]. - **Resource exhaustion (pieces, tokens, space, time):** Not applicable; 1 token used per round. - **Termination guarantee:** Guaranteed strictly by discrete tick bounds on song phase and chase phase. ## State representation - **Persistent state:** Ring size N, active runner ID, list of seated agent IDs, center penalty pool. - **Per-round state:** Phase ∈{song,chase}, tick counter t, token location ∈{0..N−1,held}, target node Vtarget. - **Observable information:** Imperfect information during Phase 1: token drop is hidden from seated agents until evaluated by sensory check. Phase 2 is fully observable. ## Action space - `drop_token(target_node)`: Runner drops token. Precondition: runner holds token and is adjacent to target node. - `sprint(speed)`: Speed ∈{1,2}. Precondition: Phase 2 active, agent is runner or chaser. ## Playability notes - **Single-player-vs-AI:** Natural; human can play as runner (optimizing drop timing/target selection) or chaser vs. AI agents. - **Group games (n>4):** Reducible cleanly to a 2-agent pursuit-evasion game on a ring graph with hidden drop latency. - **Physical-skill games:** Stealth and acceleration are modeled as detection probabilities and speed-step allocations. - **What is lost:** Communal singing synchronization, eye-contact deception, and physical playground spatial geometry. ## Implementation hints - Low complexity; discrete cyclic graph arithmetic (imodN). - First milestone: Implement 2-agent pursuit on a 12-node ring with simultaneous step resolution and tag detection.

Download as JSON

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

Download JSON
Cite this page

Drop the Handkerchief (Netherlands). (n.d.). Games of Countries. https://gamesofcountries.com/games/nl-netherlands/zakdoekje-leggen

@misc{gamesofcountries-nl-netherlands-zakdoekje-leggen,
  title = {Drop the Handkerchief (Netherlands)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/nl-netherlands/zakdoekje-leggen}
}