Skip to main content
Formal Specification

Dog on a Chain / Chained Dog — Formal Specification

Denmark · chase-tag · Confidence: low

← Back to game page

Implementation Suitability

Suitability: adaptation-requiredFidelity: discretizedGap-fills: 3
# Hund i lænke — AI-optimized specification ## General idea A high-tempo territorial tag and resource-raiding game. A central defender (the Watchdog) is physically tethered to an anchor point, guarding a cache of collectible items ("bones") scattered within the tether radius. Surrounding raiders coordinate rapid incursions into the chain zone to snatch bones and escape back across the perimeter before the Watchdog can tag them. ## Formal model - **Abstraction taken:** The continuous radial yard is discretized onto a 2D Euclidean grid with origin (0,0). The physical rope is modeled as an invariant geometric constraint restricting the Watchdog's coordinates to Euclidean distance ‖PW‖≤Rchain. Simultaneous discrete movement ticks resolve movement, item pickup, perimeter crossing, and tagging. - **Player/agent count:** 5 to 15 agents (1 Watchdog, N−1 Raiders). - **Turn model:** Synchronized discrete ticks; simultaneous action submission per tick. ## Formal rules R1. **Arena & Resources:** Arena is centered at (0,0). Chain perimeter is defined by radius Rchain=4.0. A set of K bone tokens {B1…BK} are placed at fixed positions with ‖Bk‖<Rchain. R2. **Roles & Spatial Bounds:** - 1 agent is `Watchdog`, initialized at (0,0) with spatial constraint ‖PW‖≤Rchain. - N−1 agents are `Raiders`, initialized outside the perimeter (‖PRi‖>Rchain). - A global counter `BonesSecured` is initialized to 0. R3. **Simultaneous Tick:** On each tick t, all active agents submit `move(dx, dy)` with displacement ‖(dx,dy)‖2≤1.0: - If Watchdog's displacement exceeds Rchain, position is projected back onto the circle boundary: PW←PW⋅Rchain‖PW‖. R4. **Bone Snatching & Carrying:** An unburdened Raider co-located with a bone token (‖PR−Bk‖≤0.5) automatically picks up the bone, setting Bk.carrier=R. A Raider may carry at most 1 bone simultaneously. R5. **Securing Bones:** When a Raider carrying a bone crosses strictly outside the chain perimeter (‖PR‖>Rchain), the bone is secured: `BonesSecured` increments by 1, and Bk is permanently removed from the field. R6. **Tag Resolution:** If on any tick ‖PW−PR‖≤Dtag (where Dtag=0.8) while ‖PR‖≤Rchain: - The Raider is `Tagged`. Any bone carried by the Raider is dropped at its current position. - [gap-fill] Role Rotation: The tagged Raider immediately becomes the new `Watchdog`, the former Watchdog is converted to a `Raider` relocated outside the perimeter, and uncollected bones remain in place. R7. **Raider Victory:** If `BonesSecured` equals K, the Raiders achieve total victory and the game ends. R8. [gap-fill] Time Limit & Watchdog Victory:** If after Tmax=500 ticks `BonesSecured` <K, the current Watchdog wins if BonesSecured<⌈K/2⌉; otherwise the Raiders win by majority score. ## Edge cases - Tie at the end condition: If `BonesSecured` equals exactly K/2 when Tmax expires, the match is declared a draw [gap-fill]. - A player with no legal move: `move(0, 0)` is always valid. - Repetition / cycles: Bounded by R8 (Tmax=500 ticks) and finite bone count K. - Simultaneous claims on the same resource or position: - If two Raiders reach the same bone on the same tick, possession is awarded to the Raider with lower agent index. - If Watchdog tag and bone pickup occur on the exact same tick, tag resolution takes precedence (bone is not secured). - Player elimination mid-round; turn order repair: If a Raider disconnects, they are removed from active play. If the Watchdog disconnects, the Raider closest to (0,0) is assigned as the new Watchdog. - Resource exhaustion (pieces, tokens, space, time): K bones is strictly finite; each secured bone decreases remaining field objects monotonically. - Termination guarantee: why the game provably ends: Guaranteed by monotonic increment of tick counter t→Tmax and strictly decreasing available bones K→0. ## State representation - **Persistent state:** Chain radius Rchain, total players N, bone positions {Bk}k=1K, `BonesSecured` counter. - **Per-player state:** Position (xi,yi), role (`Watchdog`, `Raider`), carried bone ID (or `None`). - **Per-turn ephemeral state:** Simultaneous action buffer, active bone carriers, current tick t. - **Observable information:** Fully observable; all agents have complete information regarding all agent positions, bone states, and boundary coordinates. ## Action space - `move(dx, dy)`: Continuous 2D vector with ‖(dx,dy)‖2≤1.0. Precondition: agent is active. - `drop_bone()`: Voluntarily release carried bone at current coordinate. Precondition: agent currently carries a bone. ## Playability notes - Single-player-vs-AI: Highly playable; human plays as Watchdog prioritizing multi-angle threats, or as a lone Raider coordinating timing against an AI defender. - Group games (n>4): Reducible to 2 agents (1 Watchdog vs 1 Raider with K=3 bones), preserving the core cat-and-mouse reach calculation. - Physical-skill games: Tether tension, agility, and physical lunges are modeled via geometric clamping and distance threshold Dtag. - What is lost in the adaptation: Physical rope entanglements, barking vocal roleplay, and genuine physical momentum pivots around a center post. ## Implementation hints Low-to-medium complexity. The geometry involves simple 2D circle intersection checks and vector clamping. First milestone: implement circular boundary clamping for 1 Watchdog and test tag intercept logic against 3 rule-based AI raiders running straight lines to bones.

Download as JSON

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

Download JSON
Cite this page

Dog on a Chain / Chained Dog (Denmark). (n.d.). Games of Countries. https://gamesofcountries.com/games/dk-denmark/hund-i-laenke

@misc{gamesofcountries-dk-denmark-hund-i-laenke,
  title = {Dog on a Chain / Chained Dog (Denmark)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/dk-denmark/hund-i-laenke}
}