Skip to main content
Formal Specification

Stiff Witch (traditional Norwegian freeze-tag variant with tunnel rescue) — Formal Specification

Norway · chase-tag · Confidence: low

← Back to game page

Implementation Suitability

Suitability: adaptation-requiredFidelity: discretizedGap-fills: 8
# Stiv heks — AI-optimized specification ## General idea Stiv heks ("Stiff Witch") is a cooperative-rescue freeze-tag game. A designated Witch pursues runners, instantly freezing them into wide-stance immobility upon touch. Frozen players can only be unfrozen when an active teammate crawls between their legs—a high-risk rescue maneuver during which the rescuer is highly vulnerable to being tagged. ## Formal model - **Abstraction taken:** The continuous play area is discretized into a 2D grid G of size W×H (20×20 cells [gap-fill]). Movement occurs in discrete simultaneous ticks. Leg-tunnel crawling is modeled as entering a frozen teammate's cell and spending kcrawl=2 dedicated ticks [gap-fill: modeling physical crawl transit] in a vulnerable immobilized state. - **Player/agent count:** 4 to 20 agents (1 Witch, N−1 Runners). Standard model: 6 agents (1 Witch, 5 Runners). - **Turn model:** Simultaneous discrete time ticks (t=1,2,…,Tround). ## Formal rules R1. **Initial Setup:** The Witch starts at the center (W/2,H/2). N−1 Runners are initialized uniformly at random coordinates ≥4 cells from the Witch [gap-fill]. R2. **Simultaneous Movement:** Each tick t, all active agents submit a movement step (dx,dy) with max⁡(|dx|,|dy|)≤1. - Runners move at speed vrunner=1.0 cell/tick. - The Witch moves at speed vwitch=1.1 cells/tick [gap-fill: slight speed advantage to ensure game convergence]. R3. **Freezing Tag:** If the Witch enters the same cell as an active Runner i (or passes through an opposing edge), Runner i transitions to `FROZEN` state. - A `FROZEN` agent cannot move and becomes a stationary rescue gateway. R4. **Tunnel Rescue Initiation & Execution:** - An active Runner j entering the cell of a `FROZEN` teammate i may execute `start_crawl(i)`. - Runner j transitions to `CRAWLING` status for kcrawl=2 consecutive ticks. While crawling, Runner j cannot move or evade. - If the Witch tags Runner j while `CRAWLING`, Runner j also becomes `FROZEN` at that location. - If kcrawl ticks elapse without a Witch tag, Runner i is immediately `LIBERATED` (`ACTIVE`), and Runner j returns to `ACTIVE` status. R5. **Victory Condition (Witch Win):** The Witch wins the round immediately if all N−1 Runners are simultaneously in `FROZEN` status. The first runner frozen in the round becomes the Witch for the next game. R6. [gap-fill] **Round Timeout (Runners Win):** If Tmax=200 ticks elapse without total freezing, the round ends. The Runners win, and the player frozen for the least total time becomes the new Witch. ## Edge cases - **Tie at the end condition:** Not applicable; Witch victory triggers on the exact tick the final active runner is frozen. - **A player with no legal move:** Frozen players have an empty action set; crawling players are locked in transit until completion or tag. - **Repetition / cycles:** Rescues can create infinite cycles; bounded strictly by the round tick limit Tmax=200 [gap-fill]. - **Simultaneous claims on the same resource or position:** Only 1 runner may crawl through a frozen teammate's legs at a time; if two runners enter simultaneously, the lower agent ID performs the crawl while the other remains active in the cell [gap-fill]. - **Player elimination mid-round; turn order repair:** No agents are permanently eliminated; frozen agents rejoin upon rescue. - **Resource exhaustion:** No physical resources consumed; arena grid is invariant. - **Termination guarantee:** Guaranteed by finite arena bounds, speed differential vwitch>vrunner, and hard tick cap Tmax=200. ## State representation - **Persistent state:** `witch_id` ∈[0,N−1], `round_number`, `first_frozen_id`. - **Per-round state:** `tick` ∈[0,Tmax], `frozen_count` ∈[0,N−1]. - **Per-agent state:** `pos` (x,y)∈G, `status` ∈{ACTIVE,FROZEN,CRAWLING}, `crawl_timer` ∈[0,kcrawl]. - **Observable information:** Perfect public information. All agent coordinates, statuses, and crawl timers are visible. ## Action space - `move(dx, dy)`: Displacement step (dx,dy)∈{(0,±1),(±1,0),(±1,±1),(0,0)}. - `start_crawl(target_frozen_id)`: Rescue action when occupying the same cell as a frozen teammate. ## Playability notes - **Single-player-vs-AI:** Highly engaging. Player as Witch managing perimeter containment against coordinated rescue bots, or Player as Runner weighing high-risk dive rescues against AI Witch pursuit. - **Group games (n>4):** Scales up to 20 players. For a 2-agent duel, 1 Witch pursues 1 Runner with stationary NPC statues that can be touched to gain speed buffs [gap-fill]. - **Physical-skill games:** Physical sprinting speed, rapid diving, and body maneuvering are discretized into directional grid steps and timed crawl delays. - **What is lost in the adaptation:** Physical somatic thrill of diving between a peer's legs, breathless gym floor squeaks, and frantic vocal shouts. ## Implementation hints - Model on a 2D integer grid with cellular automaton updates. - Prioritize crawl state updates: check Witch tags on crawling players before granting liberation. - Suggested first milestone: Implement the 2D grid freeze/unfreeze state machine with 1 Witch and 3 Runners to verify the crawling vulnerability window.

Download as JSON

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

Download JSON
Cite this page

Stiff Witch (traditional Norwegian freeze-tag variant with tunnel rescue) (Norway). (n.d.). Games of Countries. https://gamesofcountries.com/games/no-norway/stiv-heks

@misc{gamesofcountries-no-norway-stiv-heks,
  title = {Stiff Witch (traditional Norwegian freeze-tag variant with tunnel rescue) (Norway)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/no-norway/stiv-heks}
}