Skip to main content
Formal Specification

Dodgeball / Stick-Ball / Tag Ball — Formal Specification

Denmark · ball-team · Confidence: high

← Back to game page

Implementation Suitability

Suitability: adaptation-requiredFidelity: discretizedGap-fills: 3
# Stikbold (Alle mod alle) — AI-optimized specification ## General idea A high-tempo free-for-all dodgeball and tag-elimination game. Players scramble for a single foam ball inside an open court; a ball carrier may take up to 3 steps before throwing to strike an opponent below the neck. Hit players are seated on the floor, while catching a thrown ball eliminates the thrower. The core strategic dynamic is the "killer-liberation" memory chain: whenever an active player is eliminated, all players previously struck out by that specific player are instantly resurrected back into the match. ## Formal model - **Abstraction taken:** Continuous court physics and ballistic dodging are discretized onto a bounded 2D Euclidean grid with simultaneous movement ticks. The dynamic resurrection system is formalized as a directed dependency graph G=(V,E), where a directed edge (u→v) indicates that player u was eliminated by player v. - **Player/agent count:** 6 to 30 players in an all-against-all battle royale. - **Turn model:** Synchronized discrete ticks; simultaneous movement, real-time ball intercepts, and event-driven throw resolutions. ## Formal rules R1. **Arena & Entities:** Bounded 2D court 20×15 meters. N players are initialized in status `Alive`. 1 ball token is placed at center (0,0). An elimination dependency graph G=(V,E) is initialized with V={1…N},E=∅. R2. **Ball Possession & 3-Step Constraint:** An `Alive` player co-located with a free ball (‖Pi−Pball‖≤0.8) acquires possession. A ball carrier may take at most Smax=3 discrete movement steps before they must throw. R3. **Throw Action:** The carrier u submits action `throw_ball(target_id, power)`: - Trajectory travels in a straight vector toward target v. R4. **Hit vs. Catch Resolution:** - Target v submits `attempt_catch()` or `attempt_dodge()`: - *Direct Catch:* If v attempts a catch, success is P(catch)=min⁡(0.85,θcatch,v⋅(1−0.5⋅power)). If successful, thrower u is eliminated (u→Dead), edge (u→v) is added to E, and v gains possession. - *Direct Hit:* If catch fails or dodge is chosen, hit probability is P(hit)=max⁡(0.15,min⁡(0.95,θaim,u−θdodge,v)). If hit, target v is eliminated (v→Dead), edge (v→u) is added to E, v sits at current position, and the ball becomes free on the floor. - *Miss:* If hit fails, the ball bounces loose onto the floor. R5. **The Liberation Cascade (*Befrielse*):** Whenever any player k transitions from `Alive` to `Dead`: - All players w such that (w→k)∈E are immediately liberated: w.status←Alive. - All outgoing edges from liberated players (w→k) are removed from E. R6. **Headshot Foul:** A throw striking a target above the shoulders is an illegal foul; the thrower u is immediately eliminated and added to the elimination graph as killed by the fouled target. R7. **Victory Condition:** The match ends the moment exactly 1 `Alive` player remains on the court. That sole survivor is declared the victor. R8. [gap-fill] Ball Stalling Limit:** If a player holds the ball for more than Thold=30 ticks without throwing, they commit a stall foul: possession is stripped, and the ball is dropped at their feet. R9. [gap-fill] Match Time Limit:** If the match does not terminate after Tmax=1500 ticks due to recursive liberation cycles, the player with the highest total career eliminations credited across the match wins. ## Edge cases - Tie at the end condition: If multiple players tie for highest eliminations at Tmax, a 2-player sudden-death 1v1 dodgeball shootout is triggered [gap-fill]. - A player with no legal move: `Dead` players are immobilized; `Alive` players always have legal `move` or `throw` actions. - Repetition / cycles: Infinite loops of kill-and-resurrect are bounded strictly by the global tick limit Tmax=1500 in R9. - Simultaneous claims on the same resource or position: If two `Alive` players reach a loose ball on the same tick, possession is awarded to the player with the higher agility attribute θagi. - Player elimination mid-round; turn order repair: An eliminated player remains physically seated on the court (acting as a passive obstacle) until resurrected via R5. - Resource exhaustion (pieces, tokens, space, time): Conserved single ball and invariant player set; time bounded by Tmax. - Termination guarantee: why the game provably ends: Guaranteed by the hard tick bound Tmax in R9. ## State representation - **Persistent state:** Court dimensions (20×15), player roster, player skill vectors {(θaim,i,θdodge,i,θcatch,i)}, lifetime kill tallies {Ki}. - **Per-tick ephemeral state:** Player positions {Pi}, player statuses {Alive,Dead}, elimination graph G=(V,E), ball state (carrier ID, position, velocity, step counter), current tick t. - **Observable information:** Fully observable; all players observe all positions, ball location, living/dead statuses, and the full elimination dependency graph G. ## Action space - `move(dx, dy)`: 2D displacement vector. Precondition: agent is `Alive` (and steps ≤3 if carrying ball). - `grab_ball()`: Pick up loose ball. Precondition: agent is `Alive` and co-located with ball. - `throw_ball(target_id, power)`: Launch ball at target. Precondition: agent holds ball. - `attempt_catch()`: Defensive action. Precondition: agent is targeted by flying ball. - `attempt_dodge()`: Defensive action. Precondition: agent is targeted by flying ball. ## Playability notes - Single-player-vs-AI: Highly playable; human navigates spatial positioning, target prioritization, and risk-reward catching against AI opponents. - Group games (n>4): Natively designed for 6 to 30 players; the killer-liberation dynamic thrives on large agent populations. - Physical-skill games: Dodgeball throwing velocity, trajectory arcs, and reflex catching are abstracted into parameterized Bernoulli checks. - What is lost in the adaptation: The somatic sting of foam impacts, live shouting of killer names, and scrambling scuffles on the gymnasium floor. ## Implementation hints Medium complexity. Core architecture requires: (1) a directed graph data structure for G=(V,E) supporting fast parent lookups on player death, (2) spatial proximity checks for loose ball pickups, and (3) a 2D line-of-fire raycaster for throws. First milestone: implement 6-player simulation and verify correct multi-tier resurrection cascades when a top killer is eliminated.

Download as JSON

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

Download JSON
Cite this page

Dodgeball / Stick-Ball / Tag Ball (Denmark). (n.d.). Games of Countries. https://gamesofcountries.com/games/dk-denmark/stikbold

@misc{gamesofcountries-dk-denmark-stikbold,
  title = {Dodgeball / Stick-Ball / Tag Ball (Denmark)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/dk-denmark/stikbold}
}