Skip to main content
Formal Specification

Old Bear (Polish Singing Circle and Chasing Game) — Formal Specification

Poland · singing-circle · Confidence: medium

← Back to game page

Implementation Suitability

Suitability: adaptation-requiredFidelity: discretizedGap-fills: 5
# Stary niedźwiedź — AI-optimized specification ## General idea An asymmetric traditional Polish singing-circle and dramatic pursuit game where multiple circle agents orbit a stationary central "Bear" agent through discrete rhythmic chanting phases before a sudden awakening transition triggers a spatial evasion and tag resolution on a bounded 2D arena. ## Formal model - **Abstraction taken:** The circular physical dance is discretized into an 8-tick rhythmic phase on an `M×M` grid arena (default 15×15 cells, center at `(7, 7)`). During the song phase, Runner agents execute synchronized circular orbital steps around the central Bear cell. The sudden awakening at Hour 3 triggers the pursuit phase, where all Runner agents attempt to reach designated arena perimeter cells before the Bear agent closes distance to achieve an orthogonal tag. - **Player/agent count:** `N` agents (`N >= 4`, typical `N = 6..12`). Exactly 1 agent is the Bear (`B`), and `N-1` agents are Circle Runners (`R_1 .. R_{N-1}`). - **Turn model:** Two-phase structure: (1) Rhythmic Chanting Phase (8 discrete synchronized ticks), followed by (2) Pursuit Phase (simultaneous movement ticks up to `T_max = 15` ticks). ## Formal rules R1. **Setup:** - The arena is a 2D discrete grid of size `15×15` with Manhattan distance metrics. - Bear `B` is positioned at `(7, 7)` in state `SLEEPING`. - The `N-1` Runner agents are placed at radius `r = 3` cells around the center in a regular polygon layout. R2. **Chanting & Orbit Phase:** - The phase consists of 8 discrete ticks corresponding to the verse lines: - Ticks 1–4: Stanzas of *"Stary niedźwiedź mocno śpi"*. Runners rotate 1 step clockwise along the radius-3 orbit per tick. - Ticks 5–7: Hour counts (*Pierwsza godzina*, *Druga godzina*). Runners face the center and remain stationary. - Tick 8: *Trzecia godzina — ŁAPIE!* Bear `B` transitions from `SLEEPING` to `AWAKE`. R3. **Pursuit Phase Movement:** - From Tick 9 onward, all active agents act simultaneously per tick. - Each Runner agent may move up to 1 cell in any cardinal or diagonal direction (`Δx, Δy ∈ {-1, 0, 1}`) toward the outer perimeter boundaries (`x=0, x=14, y=0, y=14`). - The Bear agent `B` may move up to `v_bear = 2` cells per tick (representing the predator burst speed advantage). R4. **Tag Resolution:** - At the conclusion of each pursuit tick, if `ManhattanDistance(pos(B), pos(R_i)) <= 1` for any active Runner `R_i` who has not crossed the perimeter, `R_i` is tagged (*złapany*). - If multiple Runners are within tag range, [gap-fill] the Runner with the lowest agent index is captured. - The round ends immediately upon the first successful tag. R5. **Safe Escape:** - Any Runner `R_i` reaching a boundary cell (`x ∈ {0, 14}` or `y ∈ {0, 14}`) enters state `SAFE` and is removed from active pursuit targeting. R6. **Round Succession:** - The tagged Runner becomes the Bear for the next round. - If all Runners reach `SAFE` without anyone being tagged within `T_max = 15` ticks, [gap-fill] the Bear remains unchanged for the subsequent round. R7. [gap-fill] **Match Victory:** The match concludes after `K = N` rounds. The winner is the agent who accumulated the fewest rounds spent as the Bear. ## Edge cases - **Tie at the end condition:** If two or more agents have the same minimum rounds as Bear after `K` rounds, [gap-fill] a 1-on-1 sprint mini-round is conducted between tied contenders. - **A player with no legal move:** All agents on the open grid have at least one unoccupied adjacent cell to step into. - **Repetition / cycles:** The Chanting Phase has a fixed duration of exactly 8 ticks; the Pursuit Phase is hard-capped at `T_max = 15` ticks, guaranteeing strictly finite execution. - **Simultaneous claims on the same resource or position:** Cell stacking is permitted for Runner agents on perimeter safe cells; on internal grid cells, if two Runners attempt to move into the exact same cell, [gap-fill] the move resolves via agent index priority, while the other agent remains in their previous cell. - **Player elimination mid-round; turn order repair:** When the first Runner is tagged, the round terminates immediately; no intra-round turn order repair is required. - **Resource exhaustion:** No physical or consumable tokens are expended. - **Termination guarantee:** Each round executes in exactly `8 + T_pursuit` ticks, where `T_pursuit <= 15`, guaranteeing deterministic polynomial termination. ## State representation - **Persistent state:** `round_number` (1..K), `bear_agent_id`, `bear_round_counts` (Map[AgentId, Int]). - **Per-round state:** `phase` (CHANTING | PURSUIT | TERMINATED), `tick_counter` (0..23), `agent_positions` (Map[AgentId, (Int, Int)]), `agent_states` (Map[AgentId, {ORBITING, EVADING, SAFE, TAGGED}]). - **Observable information:** Fully observable state; all agents observe positions of all other players, current tick count, and arena boundaries. ## Action space - `orbit_step()`: Advance 1 position along the circular orbit (Chanting Phase). - `evade_step(direction ∈ {N, NE, E, SE, S, SW, W, NW, STAY})`: Runner move action during Pursuit Phase. - `chase_sprint(path: List[Direction], length <= 2)`: Bear double-step sprint toward target during Pursuit Phase. ## Playability notes - **Single-player-vs-AI:** Natural — human plays as the Bear tracking evasive heuristics, or as a single Runner calculating optimal scatter angles away from AI Bear paths. - **Group games (n>4):** Full multi-agent environment natively supported. Reduction to 2 agents: 1 Bear vs. 1 Runner starting at radius 3 on the center axis. - **Physical-skill games:** Speed differential and reaction latency are modeled via Bear speed `v_bear = 2` vs Runner speed `v_runner = 1`, and a 1-tick reaction delay parameter `P_delay` on Bear awakening. - **What is lost in the adaptation:** Choral vocal expression, theatrical body posturing, and the visceral emotional anticipation of the dramatic awakening roar are abstracted into discrete tick clocks and grid vectors. ## Implementation hints Extremely simple 2D discrete pursuit-evasion game. The Chanting Phase is a deterministic script of 8 ticks; the Pursuit Phase can be implemented using standard A* or greedy Manhattan pathfinding for the Bear and potential-field repulsive vector navigation for Runners. First milestone: verify 100% round termination within 23 ticks across 10,000 Monte Carlo rollouts.

Download as JSON

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

Download JSON
Cite this page

Old Bear (Polish Singing Circle and Chasing Game) (Poland). (n.d.). Games of Countries. https://gamesofcountries.com/games/pl-poland/stary-niedzwiedz

@misc{gamesofcountries-pl-poland-stary-niedzwiedz,
  title = {Old Bear (Polish Singing Circle and Chasing Game) (Poland)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/pl-poland/stary-niedzwiedz}
}