Skip to main content
Formal Specification

Weaver's Chain — Formal Specification

Serbia · singing-circle · Confidence: low

← Back to game page

Implementation Suitability

Suitability: adaptation-requiredFidelity: abstractedGap-fills: 3
# Kolariću Paniću — AI-optimized specification ## General idea A cooperative topological graph transformation game where a 1D linear chain of `N` linked agents executes a deterministic sequence of arch-threading permutations to transition from an open state to a crossed-arm "braided" state, and then reverses the sequence to return to the original open state without severing any edge in the graph. ## Formal model - **Abstraction taken:** The physical bodily twisting and singing performance are abstracted into a 1D topological graph G=(V,E) with vertices V={0,1,...,N−1} and undirected edges E={(i,i+1)|0≤i<N−1}. Each vertex i maintains a binary state si∈{UNBRAIDED,BRAIDED}. - **Player/agent count:** `N` cooperative agents (`N >= 4`, default `N = 6`). - **Turn model:** Step-based synchronous or sequential progression along the chain. ## Formal rules R1. Initialization: Graph G initialized with N nodes in linear order 0,1,...,N−1. Node 0 is Leader (`kolovođa`); Node N−1 is Anchor. All nodes initialize to si=UNBRAIDED. Edge connectivity parameter Eintact=true. R2. Winding Sequence (Phase 1): - For target node k from N−2 down to 1: - The chain of nodes 0..k threads through the gate formed by edge (k,k+1). - [gap-fill] Node k state updates to sk=BRAIDED. - Edge integrity check: Probability of maintaining grip Pgrip=1.0−friction_factor×(N−k). If edge fails, Eintact=false. R3. Knot State: When all nodes 1..N−2 have si=BRAIDED, the chain is declared fully knotted. R4. Unwinding Sequence (Phase 2): - For target node k from 1 up to N−2: - The chain reverses trajectory through gate (k,k+1). - Node k state updates to sk=UNBRAIDED. R5. Win Condition: If all nodes return to si=UNBRAIDED and Eintact==true, the cooperative team achieves victory. R6. [gap-fill] Failure Condition: If any edge breaks (Eintact==false), the round fails with 0 points scored. ## Edge cases - Tie at the end condition: Not applicable; pure cooperative single-team performance. - A player with no legal move: Not applicable; state transitions are fixed deterministic sequence steps. - Repetition / cycles: Bounded; Phase 1 takes exactly N−2 steps; Phase 2 takes exactly N−2 steps. Maximum execution length is 2N−4 steps. - Simultaneous claims on the same resource or position: Not applicable; nodes maintain fixed topological order. - Player elimination mid-round / turn order repair: [gap-fill] If an agent disconnects, the node is pruned from graph V and edges (k−1,k+1) are bridged. - Resource exhaustion: Not applicable; no consumable resources. - Termination guarantee: Guaranteed by the strict linear iteration counter k spanning 2N−4 total steps. ## State representation - Persistent state: `node_states: list[enum[UNBRAIDED, BRAIDED]]`, `edge_status: bool`, `current_phase: enum[WINDING, UNWINDING]`, `current_k: int`. - Per-step ephemeral state: `step_grip_maintained: bool`. - Observable information: Fully observable public state. ## Action space - `step_through_gate(node_id: int)`: Cooperative verification action per movement step. ## Playability notes - Single-player-vs-AI: Needs adaptation; natural as a puzzle game where a single player navigates a linked chain through spatial gates. - Group games (n>4): Operates natively with 4 to 20 agents. - Physical-skill games: Motor flexibility and handhold strength mapped to the Pgrip parameter. - What is lost in the adaptation: The social joy, melodic singing in unison, and physical contact of traditional folk dancing are entirely replaced by graph state transitions. ## Implementation hints Categorized as `non-simulable` / procedural graph script. Useful as an educational simulation of knot theory, topological permutations, and cooperative robotic chain maneuvering. First milestone: implement state list `[0]*N` transitioning to `[1]*N` and back to `[0]*N`.

Download as JSON

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

Download JSON
Cite this page

Weaver's Chain (Serbia). (n.d.). Games of Countries. https://gamesofcountries.com/games/rs-serbia/kolaricu-panicu

@misc{gamesofcountries-rs-serbia-kolaricu-panicu,
  title = {Weaver's Chain (Serbia)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/rs-serbia/kolaricu-panicu}
}