Skip to main content
Formal Specification

The fox goes around (Liechtenstein circle chase / Plumpssack) — Formal Specification

Liechtenstein · chase-tag · Confidence: low

← Back to game page

Implementation Suitability

Suitability: engine-readyFidelity: discretizedGap-fills: 3
# Der Fuchs geht um — AI-optimized specification ## General idea A discrete pursuit-and-spot-claiming game on a cyclic ring graph. The Fox agent moves along the perimeter and drops a token behind a seated agent. Both agents race along the ring graph to claim the vacant node. Players who fail to detect the drop before the Fox laps them are sent to the central penalty node (*Faules Ei*). ## Formal model - **Abstraction taken:** The physical circular formation is modeled as a cyclic ring graph with K=N−1 perimeter nodes (0,1…K−1) surrounding a central penalty node `Center`. Running is modeled as discrete step transitions per tick along clockwise/counter-clockwise directions, coupled with a tactile perception latency check τreact. - **Player/agent count:** N agents (6≤N≤20), configured as 1 `Fox` and K=N−1 `Seated` agents. - **Turn model:** Synchronous discrete execution per tick within round episodes. ## Formal rules R1. Setup: K seated agents occupy ring nodes 0…K−1 facing inward. One agent is initialized as `Fox` positioned outside the ring. R2. Drop Phase: - The `Fox` moves clockwise along the ring. - At any node i, the `Fox` may execute `drop_cloth(i)`. R3. Perception & Sprint Race: - Seated agent Pi performs an awareness check each tick: detected⟺(ticks_since_drop≥τreact(Pi)) - Once detected: - Pi picks up the cloth and sprints toward node i. - `Fox` continues sprinting toward node i. - Both runners move at v nodes per tick. - The runner who arrives at vacant node i first occupies the node and becomes `Seated`. - The runner who arrives second becomes the `Fox` for the next round. R4. Lapped Penalty (*Faules Ei*): - If `Fox` completes an entire lap (reaches node i) before Pi detects the drop, Pi is moved to `Center`. - [gap-fill] The Fox reclaims the cloth and begins a new drop immediately. R5. Liberation: - [gap-fill] An agent in `Center` is released when another player commits a lapped penalty, or after a maximum penalty duration of 3 rounds. R6. Match Victory: In a match of Rmax⁡=15 rounds, the agent with the lowest cumulative time spent as `Fox` and `Center` wins the match. ## Edge cases - **Tie at the end condition:** [gap-fill] If the Fox and Nest Holder reach node i on the exact same tick, the Nest Holder retains their node (defender advantage), and the Fox remains Fox. - **A player with no legal move:** Seated players wait until drop detection, then sprint; Fox always has move/drop actions. - **Repetition / cycles:** Bounded strictly by episodic round structure and hard match cap Rmax⁡=15. - **Simultaneous claims on the same resource or position:** Handled by R6 tie-breaker for node i. - **Player elimination mid-round; turn order repair:** Trapped center agents temporarily shrink the active ring size (K←K−1). - **Resource exhaustion:** Exactly 1 drop cloth in play. - **Termination guarantee:** Each sprint around a ring of size K terminates in at most ⌈K/2⌉ ticks; match terminates at Rmax⁡=15. ## State representation - **Persistent state:** Ring size K, node occupancy map, penalty queue `Center`, round counter r∈[1,15], agent penalty score vector. - **Per-round state:** Fox position, drop node index i, cloth state ∈{held,dropped,detected}, runner positions and directions. - **Observable information:** Asymmetric information. Fox observes full ring and drop state. Seated agents observe inward state only, detecting behind-back drops after latency τreact. ## Action space - `move_fox()` / `drop_cloth(node_id)`: (Fox). - `sprint_to_node()`: (Challenged Seated Agent). ## Playability notes - **Single-player-vs-AI:** Highly playable asymmetric stealth-and-sprint game. - **Group games (n>4):** Standard format operates on large rings (N≥6). - **Physical-skill games:** Sprinting acceleration and tactile peripheral glances are abstracted into discrete movement rates and perception delays. - **What is lost in the adaptation:** The spoken Alemannic rhyme melody, kindergarten playground laughter, and physical running. ## Implementation hints - Implement ring as a circular doubly-linked list or modulo array of size K. - Suggested first milestone: Implement opposite-direction sprinting and node capture resolution before adding variable reaction delays.

Download as JSON

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

Download JSON
Cite this page

The fox goes around (Liechtenstein circle chase / Plumpssack) (Liechtenstein). (n.d.). Games of Countries. https://gamesofcountries.com/games/li-liechtenstein/der-fuchs-geht-um

@misc{gamesofcountries-li-liechtenstein-der-fuchs-geht-um,
  title = {The fox goes around (Liechtenstein circle chase / Plumpssack) (Liechtenstein)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/li-liechtenstein/der-fuchs-geht-um}
}