Skip to main content
Formal Specification

Kandzyor (Belarusian Strike-the-Post Hide-and-Seek) — Formal Specification

Belarus · hide-seek · Confidence: medium

← Back to game page

Implementation Suitability

Suitability: adaptation-requiredFidelity: discretizedGap-fills: 2
# Кандзёр — AI-optimized specification ## General idea A base-tag hide-and-seek distinct for its jailbreak mechanic: rather than a single "last hider" saving everyone (as in comparable regional variants), *any* still-undetected hider can sneak to the post at any time, hurl the striker stick into the brush, and instantly free every captured player — resetting them to hidden status and forcing the Seeker to retrieve the stick and recount from zero. Spotting a hider still triggers a race to the post rather than an automatic capture. ## Formal model - **Abstraction taken:** Real stealth, sprint speed, and visual search are abstracted into stochastic checks — a spotting probability while the Seeker searches, a race-outcome probability once a hider is named, and a jailbreak-success probability — since the entry describes these qualitatively without numeric models. The play area is treated as bounded and finite (a courtyard/farmstead/orchard). - **Player/agent count:** 1 Seeker, K Hiders, K in [4, 19]. - **Turn model:** Synchronous ticks once the search phase begins; counting and initial hiding are sequential setup phases. ## Formal rules R1. Seeker selection and count (entry §1.1-1.3): the initial Seeker is chosen (uniform random among all players, via counting rhyme), and performs `count_to(T)` with eyes closed at the post, T being a predetermined number ("e.g. 30 or 50") [gap-fill: treated as a session parameter, not a single invented value]. All other players hide during this phase. R2. Search phase: each tick, the Seeker submits `move(direction)` while any hider remains `hidden`. At each tick, resolve a stochastic `spot_check` for any `hidden` hider within the Seeker's search range; success sets that hider's status to `spotted` (entry §2.1-2.2). R3. Base race (entry §2.3): the instant a hider is `spotted`, both the Seeker and that hider race to the post via `sprint_to_post()`, resolving a stochastic race-outcome check. R4. Seeker wins the race (entry §3.1): the spotted hider is `captured` and sits beside the post. R5. Hider wins the race (entry §3.2): the spotted hider becomes permanently `safe` for the remainder of the round. R6. Jailbreak (entry §4.1-4.4): at any tick, any hider still in `hidden` status (never spotted, captured, or safe) may submit `grab_and_throw_stick()`; this resolves a stochastic success check reflecting whether the Seeker is close enough to intervene [gap-fill: the entry describes the jailbreak as a stealth action against an "away searching" Seeker but gives no numeric proximity threshold, so a stochastic success check is the minimal faithful reading]. On success: every `captured` hider's status resets to `hidden` (they re-hide, entry §4.3's "everyone scatter"); already-`safe` hiders are unaffected. The Seeker must then submit `retrieve_stick()` and `return_to_post()` before restarting `count_to(T)` from the beginning (R1). R7. Round end (entry §5.1): the round ends the instant every hider's status is either `captured` or `safe` — at that point no `hidden` hider remains to trigger a jailbreak (R6), so this state is stable once reached. R8. Role transition (entry §5.2): the first hider who was `captured` in the round that ended without a subsequent jailbreak reversing their status becomes the new Seeker for the next round. ## Edge cases - Tie at the end: not applicable — R3's race check resolves to a single winner per race; there is no mechanism for a genuinely simultaneous post-touch in the entry's description. - A player with no legal move: not applicable — the Seeker always has `move`/`sprint_to_post`/`retrieve_stick` available (phase-dependent); any `hidden` hider always has `sneak`/`grab_and_throw_stick()` available; a `spotted` hider always has `sprint_to_post()` available. - Repetition / cycles: a jailbreak (R6) can in principle recur multiple times before the round finally ends, each time reverting the `captured` pool to `hidden` and restarting the count — this is a genuine, expected structural feature, not a flaw, and does not threaten eventual termination (see below). - Simultaneous claims on one position: not applicable — the post supports one active race resolution at a time (R3); the stick has a single well-defined location (at the post, thrown, or being retrieved). - Elimination mid-round and turn-order repair: a `captured` hider can be reverted to `hidden` in bulk by a jailbreak (R6); there is no turn order to repair since the search phase is simultaneous, not sequential. - Resource exhaustion: not applicable — no consumable resource; the stick is reused every count cycle. - Termination guarantee: the play area is finite and bounded, and every `hidden` hider is spotted with probability 1 given enough ticks (the standard hazard-style search argument used throughout this batch for hide-and-seek games). Each spot resolves in a single race with fixed positive probability of either outcome (R3-R5), and jailbreak attempts (R6) each carry a fixed positive success probability but require at least one `hidden` hider to exist. Since `safe` status is permanent and non-reversible, the pool of hiders who could ever become `hidden` again (via a jailbreak reverting them from `captured`) shrinks over time as more hiders permanently exit to `safe`; eventually no `hidden` hider remains to trigger further jailbreaks, and the round reaches the stable all-captured-or-safe state (R7) with probability 1. ## State representation - Persistent (session) state: `seeker_id`, `round_number`. - Per-round state: `status[hider]` ∈ {hidden, spotted, captured, safe}, `captured_order` (list, to determine R8's "first captured" once the round ends without further jailbreak reversal). - Per-tick ephemeral state: `positions` (Seeker and any hider currently racing or attempting a jailbreak), `stick_location`. - Observable information: the Seeker has no information about `hidden` hiders' positions until a `spot_check` succeeds; hiders have full information about the Seeker's position at all times (needed to judge jailbreak risk). ## Action space - `count_to(T)`: the Seeker only, setup/restart phase. - `move(direction)`: the Seeker only, search phase; precondition: any hider remains unresolved. - `sprint_to_post()`: the Seeker (after spotting) or a `spotted` hider; precondition: a race is active (R3). - `grab_and_throw_stick()`: any `hidden` hider; precondition: stick is at the post, at least one hider is `captured`. - `retrieve_stick()` / `return_to_post()`: the Seeker only; precondition: a jailbreak has just occurred (R6). ## Playability notes - Single-player-vs-AI: natural on either side — human Seeker against AI hiders managing when to risk a jailbreak sprint, or human hider timing a jailbreak dash against an AI Seeker's search pattern and proximity. - Reducing K > 4 to 2 agents: mechanically trivial (fewer hiders), but removes the jailbreak's collective-stakes drama, which specifically depends on there being multiple captured comrades worth freeing. - Physical-skill games: real stealth positioning, sprint speed, and visual search are the entire game and are collapsed into stochastic checks (R2-R3, R6); no genuine spatial reasoning or athleticism is modeled. - What is lost: the actual tension of a stealth approach to the post while captured friends wait, the dramatic cry of "Кандзёр разбіты!" as the stick flies into the brush, the counting rhyme's ritual phrasing, and the collective solidarity of a well-timed jailbreak. ## Implementation hints State is modest (a status enum per hider plus positions and a stick location); the real design difficulty is calibrating `spot_check`, race-outcome, and jailbreak-success probabilities as functions of position/proximity, none of which the source quantifies. First milestone: implement the search/race/jailbreak loop (R2-R6) with flat probabilities to verify the all-captured-or-safe round-end condition (R7) and role transition (R8), then add position-dependent probabilities.

Download as JSON

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

Download JSON
Cite this page

Kandzyor (Belarusian Strike-the-Post Hide-and-Seek) (Belarus). (n.d.). Games of Countries. https://gamesofcountries.com/games/by-belarus/kandzyor

@misc{gamesofcountries-by-belarus-kandzyor,
  title = {Kandzyor (Belarusian Strike-the-Post Hide-and-Seek) (Belarus)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/by-belarus/kandzyor}
}