Skip to main content
Formal Specification

Fallen Stick — Formal Specification

Iceland · hide-seek · Confidence: low

← Back to game page

Implementation Suitability

Suitability: engine-readyFidelity: discretizedGap-fills: 7
# Fallin spýta — AI-optimized specification ## General idea A classic Icelandic hide-and-seek and base-guarding game. One seeker guards an upright wooden stick (*spýta*) propped against a central base rock while searching the environment for hidden players. Spotted hiders are captured and held as prisoners at the base; however, any remaining free hider can make a high-stakes sprint to kick over the stick, shouting *"Fallin spýta!"*, which instantly liberates all captured prisoners and forces the seeker to reset the stick and recount. ## Formal model - **Abstraction taken:** Continuous outdoor terrain with visual occlusion is discretized into a 2D environment containing a Home Base (with the upright stick) and H discrete hiding positions with variable occlusion values. Visual detection, prisoner guarding, base sprints, and stick resets are resolved on discrete time-ticks. [gap-fill] Occlusion values, sprint speeds, and maximum recount limits formalize playground conventions. - **Player/agent count:** N agents (modeled as N=6: 1 Seeker, 5 Hiders). - **Turn model:** Tick-based real-time simulation across counting, searching, and base-sprint phases. ## Formal rules R1. Setup: The map consists of a central Home Base at (0,0) where the stick is propped in state `UPRIGHT`, and H=10 discrete Hiding Spots with occlusion factors ωi∈[0.4,0.9] [gap-fill]. Initially, all Hiders are in state `FREE`. R2. Phase 1 — Counting: - The Seeker stands at (0,0) in state `COUNTING` for Tcount=30 ticks with vision disabled. - During counting, all Hiders select and move to a hiding spot hi. R3. Phase 2 — Searching & Base Guarding: - At tick 30, the Seeker enters state `SEARCHING`, patrolling the map at speed Speedseeker. - Detection: On each tick, for each free hider within line of sight, the Seeker detects the hider with probability: P(Detect)=DistanceMax−dDistanceMax×(1−ωi) [gap-fill]. - Upon detection of Hider k, the Seeker must return to Home Base (0,0) and declare a tag (*negla*). R4. Tagging & Imprisonment: - If the Seeker reaches Home Base and calls *"Fallin spýta fyrir [Name]!"* before Hider k can kick the stick, Hider k transitions to state `PRISONER` and is confined to the base perimeter. - The order of captures is recorded in a `capture_queue`. R5. Kicking the Stick (*Fella spýtuna*): - At any time during Phase 2, any unspotted `FREE` hider may sprint toward (0,0). - If the hider reaches the base while the stick is `UPRIGHT` and before the Seeker can physically tag them, the hider executes the `kick_stick()` action. - The stick transitions to state `TOPPLED`. - **Prisoner Liberation:** All players in state `PRISONER` immediately return to state `FREE` and sprint back into hiding. - The Seeker is forced into state `RECOUNTING` for Trecount=10 ticks [gap-fill] to reset the stick before resuming the search. R6. Game Victory & Succession: - The Seeker wins the round if all N−1 Hiders are simultaneously held in state `PRISONER`. - The **first player captured** in the winning round becomes the Seeker for the subsequent round. - [gap-fill] If the stick is toppled **5 times in a single round**, the Seeker is declared exhausted and loses the round, remaining the Seeker for the next game. ## Edge cases - Tie at the end condition: If a sprinting hider attempting to kick the stick and the returning seeker arrive at base on the exact same tick, the hider's kick takes precedence [gap-fill] (pro-liberation traditional convention). - A player with no legal move: Not applicable — free hiders can always remain in cover or sprint; prisoners wait at base. - Repetition / cycles: Infinite prisoner-liberation cycles are bounded by the R6 5-topple recount limit [gap-fill]. - Simultaneous claims on the same resource or position: Multiple prisoners gather at base peacefully; multiple free hiders sprinting to kick the stick succeed if any one hider kicks it. - Player elimination mid-round; turn order repair: Hiders transition dynamically between `FREE` and `PRISONER`; role assignments (Seeker vs Hider) persist until the entire round concludes. - Resource exhaustion: Stick can be knocked down and reset indefinitely; player population N is constant. - Termination guarantee: Guaranteed by the absorbing state of all N−1 prisoners captured or the R6 5-topple exhaustion limit. ## State representation - Persistent state: - `round_number`: integer. - `current_seeker_id`: agent ID. - `scores`: map `{agent_id: int}`. - Per-round ephemeral state: - `stick_state`: `{UPRIGHT, TOPPLED}`. - `hider_states`: array of `{FREE, PRISONER, IN_SPRINT}`. - `agent_positions`: map `{agent_id: (x, y)}`. - `capture_queue`: list of captured agent IDs in chronological order. - `topple_count`: integer `[0..5]`. - `current_tick`: integer. - Observable information: - Seeker observes only line-of-sight terrain, base status, and prisoner count. - Free hiders observe Seeker position, base status, and fellow prisoner states. ## Action space - Seeker: `patrol_to(x, y)`, `tag_at_base(hider_id)`, `reset_stick_and_count()`. - Free Hider: `hide_at(spot_id)`, `sprint_to_base()`, `kick_stick()`. - Prisoner: `idle_at_base()`, `flee_on_liberation()`. ## Playability notes - Single-player-vs-AI: Natural — human plays as the Seeker managing the trade-off between exploring deep territory and guarding the stick, or plays as a hider coordinating daring rescue sprints. - Group games (n>4): Scales naturally to 15+ players; reducing to 4 players (1 seeker, 3 hiders) preserves all strategic tension. - Physical-skill games: Physical sprinting speed and visual camouflage are abstracted into tick velocities and occlusion probabilities. - What is lost in the adaptation: The physical crash of knocking over real wooden sticks and the breathless farmyard stealth are formalized into discrete spatial state logic. ## Implementation hints - Model seeker AI with two competing utility functions: `Utility(Search)` vs `Utility(ReturnToBaseGuard)`. - Use raycasting or simple distance/occlusion checks for line-of-sight detection. - Suggested first milestone: implement R1–R5 (counting phase, detection and tag-out, stick toppling and prisoner liberation, and victory condition).

Download as JSON

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

Download JSON
Cite this page

Fallen Stick (Iceland). (n.d.). Games of Countries. https://gamesofcountries.com/games/is-iceland/fallin-spyta

@misc{gamesofcountries-is-iceland-fallin-spyta,
  title = {Fallen Stick (Iceland)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/is-iceland/fallin-spyta}
}