Skip to main content
Formal Specification

Twelve Sticks — Formal Specification

Lithuania · hide-seek · Confidence: low

← Back to game page

Implementation Suitability

Suitability: adaptation-requiredFidelity: discretizedGap-fills: 8
# Dvylika pagaliukų — AI-optimized specification ## General idea Dvylika pagaliukų is an asymmetric hide-and-seek and territory-defense game played on a 2D spatial graph with a central seesaw catapult. At round start, twelve wooden sticks are catapulted across the field, forcing the seeker to gather and restack all twelve sticks before commencing any search. Hiders utilize cover nodes to evade detection, execute decoy runs, and attempt high-stakes sprint strikes to kick the catapult board, which immediately scatters the sticks again and releases all captured prisoners. ## Formal model - **Abstraction taken:** Discretized. The physical environment is modeled as a 2D planar graph G=(V,E) featuring a central baseboard node vbase, open traversal paths, and designated cover nodes Vcover⊂V with line-of-sight occlusion [gap-fill]. Continuous foot sprints and stick tosses are mapped to movement points per tick and random 2D scatter coordinates. - **Player/agent count:** N agents (4≤N≤15): 1 designated seeker (S) and N−1 hiders (H1…HN−1). - **Turn model:** Synchronous discrete time ticks (t=1,2,…). All agents submit movement and interaction actions concurrently; spatial updates, line-of-sight checks, and base interactions resolve in strict order. ## Formal rules R1. Setup: Seeker S is placed at vbase. Hiders are placed at adjacent starting nodes. The catapult board at vbase contains an inventory of 12 sticks (K=12). R2. The Launch Phase (t=1): - A designated hider executes `kick_catapult()`. - The 12 sticks are scattered to nodes v∈V∖{vbase} sampled uniformly within radius Rscatter∈[3,8] graph hops [gap-fill]. - All hiders receive a movement bonus of Minit=5 steps [gap-fill] to reach hiding cover while S is immobilized. R3. The Gathering Phase: - S must traverse the graph to collect all 12 sticks. - S executes `pickup_stick()` on occupied nodes (carrying capacity = 12) and returns them to vbase via `deposit_sticks()`. - S is prohibited from initiating a spot/tag action until Kbase=12. R4. The Search and Tapping Phase: - Once Kbase=12, S may search the graph. - Line-of-Sight (LOS): S observes a hider Hi if Hi is within visibility range Rvis and not fully occluded by an intervening cover node. - Spot and Tap: If S establishes LOS on Hi, S must move to vbase and execute `tap_board(H_i)` to capture Hi. - If successful, Hi transitions to `jailed` status and is moved to vbase detention queue. R5. The Rescue Strike: - Any active hider Hj (`status = free`) may move to vbase and execute `kick_catapult()`. - Precondition: Hj is co-located at vbase and S is not actively occupying vbase [gap-fill]. - Effect: All 12 sticks are re-scattered across the graph (Kbase→0); all jailed hiders are instantly freed (`status = free`) and granted a 3-tick sprint window [gap-fill]; S is forced back into the Gathering Phase. R6. End Condition and Inning Transition: - The round terminates in a seeker victory when all N−1 hiders are simultaneously `jailed`. - The first hider captured in the sequence is assigned as the new seeker S′ for the next round. - If the round exceeds a global timeout Tmax⁡=600 ticks, the game terminates as a hider victory [gap-fill]. ## Edge cases - Tie at the end condition: If a seeker attempts `tap_board(H_i)` and a hider attempts `kick_catapult()` at vbase on the exact same tick, the kick takes priority, resolving as a rescue [gap-fill]. - A player with no legal move: Not applicable — `stay()` is always a legal action at any node. - Repetition / cycles (and the loop-breaking rule): Infinite cycles of capture and rescue are bounded by the global tick limit Tmax⁡=600 ticks [gap-fill]. - Simultaneous claims on the same resource or position: Multiple hiders and sticks can co-exist on the same node without collision locks. - Player elimination mid-round; turn order repair: Jailed hiders are temporarily immobilized at vbase; their turns become null operations until freed by a rescue strike. - Resource exhaustion (pieces, tokens, space, time): Sticks are fixed at 12 and indestructible; expiration of time budget Tmax⁡ halts play. - Termination guarantee: Provably terminates due to the deterministic bounded tick counter Tmax⁡. ## State representation - Persistent state: - Graph topology G=(V,E). - Seeker ID, Hider status table (statusi∈{Free,Jailed}, capture sequence queue). - Stick location array: loc(s)∈V∪{Inventory,BaseBoard} for s∈{1…12}. - Global tick counter t. - Per-turn ephemeral state: - Agent coordinate vector x→, movement vectors, LOS detection matrix, pending baseboard interactions (`tap_board` vs `kick_catapult`). - Observable information: - Hiders observe global graph layout, stick positions, and seeker position when within line-of-sight. - Seeker observes full graph layout, current stick locations, and only hiders with active unoccluded LOS. ## Action space - `move(target_node)`: Traverse to an adjacent connected node in G (all agents). - `pickup_stick()`: Collect a stick present at current node (seeker only). - `deposit_sticks()`: Unload carried sticks onto catapult board at vbase (seeker only). - `tap_board(hider_id)`: Execute formal capture announcement at vbase for a spotted hider (seeker only). - `kick_catapult()`: Trigger stick scatter and mass prison break at vbase (hiders only). - `stay()`: Remain in current cover node without movement (all agents). ## Playability notes - Single-player-vs-AI: Highly compelling — player can control the seeker managing baseboard defense vs search risk, or play a stealth hider coordinating rescue kicks with AI teammates. - Group games (n>4): Reducible to 2 agents (1 seeker vs 1 hider), but loses the essential multiplayer sacrifice/decoy and rescue-cascade dynamics. - Physical-skill games: Physical foot sprints and stealth evasion are abstracted into graph shortest paths, line-of-sight polygons, and tick speeds. - What is lost: The adrenaline rush of physical outdoor sprints, spatial hiding behind real shrubs/fences, and vocal shouting formulas are translated into discrete graph mechanics. ## Implementation hints Graph representation requires precomputing line-of-sight occlusion masks for all pair-nodes. A discrete 2D grid with obstacle blocks (15×15) serves as an ideal spatial environment. First milestone: Build the gathering phase state machine (stick scatter and 12-stick retrieval loop) before adding hider stealth and capture logic.

Download as JSON

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

Download JSON
Cite this page

Twelve Sticks (Lithuania). (n.d.). Games of Countries. https://gamesofcountries.com/games/lt-lithuania/dvylika-pagaliuku

@misc{gamesofcountries-lt-lithuania-dvylika-pagaliuku,
  title = {Twelve Sticks (Lithuania)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/lt-lithuania/dvylika-pagaliuku}
}