Skip to main content
Formal Specification

Ten sticks on a board — Formal Specification

Finland · hide-seek · Confidence: high

← Back to game page

Implementation Suitability

Suitability: engine-readyFidelity: discretizedGap-fills: 3
# Kymmenen tikkua laudalla — AI-optimized specification ## General idea An outdoor hide-and-seek game centered around a physical seesaw launching board with 10 wooden sticks. At the start, the sticks are catapulted into the air, forcing the seeker to spend valuable search time gathering and re-stacking all 10 sticks on the board before hunting can begin. Hidden players can execute high-risk rescue runs to stomp the seesaw board again, scattering the sticks and completely wiping out all seeker progress. ## Formal model - **Abstraction taken:** The physical terrain is discretized into a 2D obstacle grid with raycast line-of-sight (LOS). The catapulting of 10 sticks is modeled as a dispersion function scattering 10 stick items across grid coordinates within radius Rscatter around the seesaw board location B=(x0,y0). Stick retrieval requires moving to each coordinate and carrying it back to B. - **Player/agent count:** N agents (3≤N≤15), configured as 1 Seeker and N−1 Hiders. - **Turn model:** Simultaneous discrete execution per tick. ## Formal rules R1. **Setup & Seesaw Launch:** - Seesaw board is fixed at coordinate B. - At tick t=1, a launch event triggers: 10 stick items S1…S10 are scattered to random accessible grid cells within radius R∈[5,15] of B. - All N−1 Hiders immediately disperse into the grid to seek hiding positions behind occluding obstacles. R2. **Stick Gathering Phase:** - The Seeker cannot spot or capture any hiders while the board has <10 sticks. - The Seeker moves to grid cells containing scattered sticks. Upon entering a cell with stick Si, the stick is collected into the Seeker's inventory (max capacity: 10 sticks). - When the Seeker returns to B, all carried sticks are placed onto the board. - When the board stick count reaches exactly 10, the Seeker enters the `Hunting` phase. R3. **Spotting and Board Tagging:** - In the `Hunting` phase, if the Seeker gains unoccluded LOS to an uncaught hider Hj, the Seeker may execute `spot(H_j)`. - The Seeker must return to B and execute `tag_board(H_j)`. - If completed before Hj reaches B, Hj is placed into `jailed` state near B. R4. **The Board Stomp Rescue:** - Any un-jailed hider Hj may move to cell B at any time. - If Hj reaches B and executes `stomp_board()`, all 10 sticks are instantly catapulted into newly scattered grid cells within radius R, and all players in `jailed` state immediately revert to `free` status. - The Seeker reverts to the `Gathering` phase and must collect all 10 sticks anew before any spotting/tagging can resume. R5. **Action Conflicts:** [gap-fill] If Seeker and Hider reach board B simultaneously on the same tick, the Hider's `stomp_board()` action executes before the Seeker's `tag_board()`, successfully triggering the stick scatter and rescue. R6. **Round Resolution & Role Swap:** - The round terminates when all N−1 hiders are simultaneously `jailed` and all 10 sticks are stacked on the board. - [gap-fill] The first player who was jailed in the round (and not subsequently freed before the final resolution) becomes the Seeker for the subsequent round. ## Edge cases - **Tie at the end condition:** Not applicable — Seeker wins if all hiders are jailed; hiders avoid loss as long as at least one hider successfully maintains free status or triggers rescues. - **A player with no legal move:** Jailed players execute `noop`. Active players blocked by obstacles have (0,0) (stand still) as fallback. - **Repetition / cycles:** [gap-fill] To prevent infinite rescue loops, a maximum game limit of Tmax⁡=2000 ticks (or maximum 5 board stomps per match) is enforced. If the limit is reached, all un-jailed hiders win. - **Simultaneous claims on the same resource or position:** Handled by R5 (stomp takes precedence over tag). Multiple hiders can occupy board cell B simultaneously. - **Player elimination mid-round; turn order repair:** Jailed players become inactive observers; tick processing continues for all remaining agents simultaneously. - **Resource exhaustion (pieces, tokens, space, time):** The 10 sticks are conserved and recycled indefinitely upon each stomp. Time bounded by Tmax⁡. - **Termination guarantee: why the game provably ends:** Guaranteed by the finite tick limit Tmax⁡ and hard ceiling on maximum stomp resets. ## State representation - **Persistent state:** Grid terrain map; board location B; tick counter t; total stomp count; match status. - **Per-player state:** Position (x,y); role ∈{Seeker,Hider}; status ∈{free,spotted,jailed}; inventory stick count (Seeker); order of capture index. - **Board/Stick state:** Coordinates of each stick S1…S10 (either on grid (x,y), in Seeker inventory, or mounted on board B); count of sticks on board ∈[0,10]. - **Observable information:** Imperfect information. Seeker observes obstacles and sticks in local LOS. Hiders observe local LOS and global audio broadcast of stick count completion. ## Action space - `move(dx, dy)`: where dx,dy∈{−1,0,1}. - `collect_stick(stick_id)`: (Seeker only) valid when in same cell as a scattered stick. - `deposit_sticks()`: (Seeker only) valid when at board B. - `spot(target_id)`: (Seeker only) valid when in Hunting phase and target is in LOS. - `tag_board(target_id)`: (Seeker only) valid when at board B and target is spotted. - `stomp_board()`: (Hider only) valid when at board B. - `noop()`: wait/idle. ## Playability notes - **Single-player-vs-AI:** Highly engaging. Playing as Seeker requires optimizing the shortest-path traveling salesperson route to gather sticks quickly before patrol lines can be set up; playing as Hider requires timing the board stomp during the Seeker's distant stick-hunting expeditions. - **Group games (n>4):** Reduces naturally to 2 agents (1 Seeker vs 1 Hider), where the hider must balance staying hidden vs risking an immediate board stomp while the seeker is distracted. - **Physical-skill games:** The mechanical lever launch is abstracted as a stochastic spatial dispersion function f(R,θ). - **What is lost in the adaptation:** The kinetic joy of stomping a real wooden plank, the clatter of flying twigs, and the physical dash through underbrush. ## Implementation hints - Model stick collection as a lightweight spatial inventory pickup. - Branching factor: 9 movement actions + contextual interaction triggers. - Suggested first milestone: Implement the stick scattering and collection logic on a 15×15 grid, verifying that the Seeker cannot transition to hunting state until all 10 sticks are deposited at base B.

Download as JSON

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

Download JSON
Cite this page

Ten sticks on a board (Finland). (n.d.). Games of Countries. https://gamesofcountries.com/games/fi-finland/kymmenen-tikkua-laudalla

@misc{gamesofcountries-fi-finland-kymmenen-tikkua-laudalla,
  title = {Ten sticks on a board (Finland)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/fi-finland/kymmenen-tikkua-laudalla}
}