Skip to main content
Formal Specification

Twelve Sticks — Formal Specification

Estonia · hide-seek · Confidence: medium

← Back to game page

Implementation Suitability

Suitability: adaptation-requiredFidelity: discretizedGap-fills: 7
# 12 pulka (Twelve Sticks) — AI-optimized specification ## General idea A high-stakes tactical hide-and-seek game structured around a physical lever base and 12 collectible stick tokens. The seeker must collect scattered sticks to activate searching rights, while hiders exploit the seeker's distance from home base to either stay concealed or stealthily sprint in to kick the board, scattering the sticks and resetting all captured prisoners. ## Formal model - **Abstraction taken:** The continuous 3D farmyard and seesaw lever physics are discretized into a 2D topological grid with line-of-sight (LOS) obstacles. The lever stomp is modeled as a 2D stochastic radial dispersion of 12 stick tokens from the origin (0,0). - **Player/agent count:** 1 Seeker agent, N Hider agents (N≥2). - **Turn model:** Synchronous discrete ticks. All agents submit movement and interaction actions simultaneously each tick. ## Formal rules R1. Grid and Base: The environment is a 2D grid with passable cells and LOS-blocking obstacle cells. The board base is located at coordinate (0,0). R2. Setup and Scatter: - At tick t=0, 12 stick tokens are launched from (0,0) and distributed to random ground coordinates (xi,yi) within a radius Rscatter [gap-fill: stick locations sampled from a uniform radial distribution r∼U(2,Rscatter),θ∼U(0,2π)]. - Board stick count S=0. Seeker status is `COLLECTING`. All Hiders status is `HIDING`. R3. Phase 1 (Collection Phase): - While S<12, the Seeker's field of vision is restricted to an immediate 1-cell radius (Seeker cannot scan for hiders while gathering sticks). - Seeker moves up to vseeker cells per tick to pick up sticks (auto-collected on entering cell) and must bring them back to (0,0) to deposit onto the board. - Hiders move up to vhider cells per tick into concealment behind obstacle cells. R4. Phase 2 (Search Phase): - When S=12 on (0,0), Seeker status becomes `SEARCHING` with full directional line-of-sight (LOS). - Seeker moves through the environment to find Hiders. - A Hider Hi is *spotted* if there is an unblocked ray of visibility between Seeker and Hi within detection range Dvision. R5. Capture Resolution: - Once Hi is spotted, Seeker must return to (0,0) and execute `tag_board(H_i)` while Hi remains in LOS or before Hi reaches the board. - If Seeker executes `tag_board(H_i)` successfully, Hi enters `CAPTURED` status and is teleported to the prison zone adjacent to (0,0). R6. Board Kick / Liberation: - Any active uncaptured Hider Hj who moves into cell (0,0) may execute `kick_board()` on their tick. - If `kick_board()` is executed while the Seeker is not at (0,0): 1. All 12 sticks are re-scattered per R2 [gap-fill: stick scatter is re-sampled]. 2. Board stick count resets to S=0. 3. All `CAPTURED` players immediately transition back to `HIDING` status and may disperse. 4. Seeker reverts to `COLLECTING` status. R7. Round End and Termination: - The round ends with a Seeker victory when all N Hiders are in `CAPTURED` status simultaneously. - [gap-fill: to guarantee termination, each successive board kick reduces the maximum scatter radius by 10% (Rscatter←max⁡(2,0.9⋅Rscatter)), and a hard turn cap Tmax=500 ticks awards the win on points]. R8. [gap-fill: The first player captured during the round is queued to become the Seeker for the subsequent round]. ## Edge cases - Tie at the end condition: If a Hider executes `kick_board()` on the exact same tick the Seeker executes `tag_board()`, the hider's board kick takes strict priority [gap-fill: simultaneous kick-vs-tag priority]. - A player with no legal move: Not applicable; agents can always choose `wait()` or move to an adjacent open cell. - Repetition / cycles: Bounded by the decaying scatter radius rule in R7 and the global round tick limit Tmax [gap-fill: cycle bounding via scatter decay]. - Simultaneous claims on the same resource or position: Multiple hiders can occupy the same cell or attempt `kick_board()` simultaneously; if at least one succeeds, the board scatters once. - Player elimination mid-round; turn order repair: Captured hiders wait passively in prison; they retain their agent state and are fully restored upon liberation. - Resource exhaustion: Stick count is fixed at 12; sticks are never destroyed or permanently removed. - Termination guarantee: Enforced by the finite tick limit Tmax and monotonic reduction in scatter radius per kick [gap-fill: finite tick cap guarantee]. ## State representation - Persistent state: - `board_sticks`: Integer S∈[0,12]. - `stick_positions`: List of 12 coordinates (xi,yi) on grid or `IN_INVENTORY`. - `seeker_mode`: `COLLECTING` or `SEARCHING`. - `player_states`: Map of Agent ID →{HIDING,CAPTURED}, plus position (x,y). - `capture_order`: Ordered list of captured player IDs. - `kick_count`: Integer count of board resets. - Per-tick ephemeral state: - `los_visibility_matrix`: Boolean visibility between Seeker and each Hider. - `simultaneous_actions`: Buffer of submitted agent actions for current tick. - Observable information: - Seeker observes: Stick locations when collecting; LOS-visible hiders and base status when searching. - Hiders observe: Seeker position (if in direct line of sight / hearing range), board status, stick count S. ## Action space - `move(dx, dy)`: Move up to v cells (|dx|+|dy|≤v). - `pickup_stick(stick_id)`: Collect stick in current cell (Seeker only). - `deposit_sticks()`: Place carried sticks onto (0,0) (Seeker only). - `tag_board(target_id)`: Tag spotted hider at (0,0) (Seeker only). - `kick_board()`: Kick lever at (0,0) to liberate prisoners (Hider only). - `wait()`: Remain stationary. ## Playability notes - Single-player-vs-AI: Highly compelling. Single human hider with AI co-hiders vs AI seeker, or human seeker managing collection efficiency and territory surveillance against stealth AI hiders. - Group games (n>4): Reduces naturally to 1 Seeker vs 1 Hider, though 1v1 removes the collaborative distraction and rescue dynamic (since no teammate exists to kick the board while another is hunted). - Physical-skill games: Sprint speed is parameterized as movement rate (vseeker>vhider); stealth is parameterized as LOS distance and obstacle shadows. - What is lost in the adaptation: The visceral excitement of stomping a wooden seesaw lever, the physical clatter of airborne sticks, and the tactile panic of diving into tall grass. ## Implementation hints Use a 40×40 grid with 15–20 rectangular obstacle blocks representing farm buildings and trees. Line-of-sight is easily computed via Bresenham's line algorithm. First milestone: Implement stick scattering, collection loop, and board kick reset before layering LOS perception.

Download as JSON

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

Download JSON
Cite this page

Twelve Sticks (Estonia). (n.d.). Games of Countries. https://gamesofcountries.com/games/ee-estonia/kaksteist-pulka

@misc{gamesofcountries-ee-estonia-kaksteist-pulka,
  title = {Twelve Sticks (Estonia)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/ee-estonia/kaksteist-pulka}
}