Formal Specification
Polish Tag (Berek — Squat Tag, Wood Tag & Freeze Tag) — Formal Specification
Poland · chase-tag · Confidence: low
← Back to game pageImplementation Suitability
Suitability: engine-readyFidelity: discretizedGap-fills: 2
# Berek — AI-optimized specification
## General idea
A high-tempo asymmetric pursuit-evasion game on a bounded 2D grid incorporating tactical conditional safety stances (Squat Tag / *Berek kucany*). The Chaser possesses a movement speed advantage, but Evaders can deploy temporary immunity tokens (squatting) to survive tight corners at the cost of stationary vulnerability.
## Formal model
- **Abstraction taken:** The continuous field is discretized into a toroidal or bounded Cartesian grid. Continuous sprinting speeds are discretized into movement points () per turn tick: the Chaser receives cells per tick; Evaders receive cell per tick.
- **Player/agent count:** 5 agents: Agent 0 (initial *Berek*), Agents 1..4 (Evaders).
- **Turn model:** Simultaneous tick-based phase structure. All agents submit movement or posture actions simultaneously.
## Formal rules
R1. **Setup:** Arena is a bounded grid. Berek starts at . Evaders start at coordinates . Each evader starts with squat immunity tokens and a cumulative survival score of 0.
R2. **Action space per tick:**
- Evader submits: `move(dx, dy)` () OR `squat()` (if and not already squatted).
- Berek submits: `sprint(dx, dy)` ().
R3. **Squat state dynamics:**
- If an evader executes `squat()`: consumes 1 token ().
- The evader gains `Immune = True` for exactly 2 consecutive ticks, during which they cannot move ().
- On tick 3, the agent automatically returns to standing (`Immune = False`) and must move.
R4. **Tag collision check:**
- At the end of a simultaneous movement tick, if Berek occupies the same coordinate as an Evader :
- If has `Immune == True`: Tag fails; no role change.
- If has `Immune == False`: Tag succeeds.
R5. **Tag transfer & Anti-tag-back rule (*Bez oddawania*):**
- Upon a successful tag on :
- becomes the new *Berek*.
- The previous Berek becomes an Evader and receives an immunity shield against for exactly 3 ticks (`GracePeriod = 3`).
R6. **Scoring and victory:**
- Each tick an agent is an Evader, they gain survival point.
- [gap-fill] The game runs for a fixed horizon of ticks. The agent with the highest cumulative survival score wins.
## Edge cases
- **Tie at the end condition:** If two agents have equal survival points at tick 100, [gap-fill] the agent with more remaining squat tokens wins.
- **A player with no legal move:** Boundary collisions clip movement to within grid limits ; staying stationary (`move(0, 0)`) is always legal.
- **Repetition / cycles:** The match terminates deterministically at tick .
- **Simultaneous claims on the same resource or position:** Multiple evaders can occupy the same grid cell without obstruction; Berek tags all non-immune evaders in their landing cell.
- **Player elimination mid-round; turn order repair:** No elimination; roles transfer dynamically among all 5 agents.
- **Resource exhaustion:** Squat tokens are finite (3 per game per agent); once depleted, an evader must rely purely on spatial pathfinding.
- **Termination guarantee:** Guaranteed strictly by the fixed-horizon simulation loop .
## State representation
- **Persistent state:** `survival_scores` (Map[AgentId, Int]), `current_berek_id` (AgentId), `grace_period_timer` (Int), `tick_counter` (1..100).
- **Per-player state:** `coord` (), `squat_tokens_left` (0..3), `squat_cooldown_remaining` (0..2), `is_immune` (Bool).
- **Observable information:** Fully observable state; all agent coordinates, Berek identity, immunity flags, and timers are common knowledge.
## Action space
- `move(dx: Int[-1..1], dy: Int[-1..1])`: Normal evader step.
- `sprint(dx: Int[-2..2], dy: Int[-2..2])`: Berek multi-step pursuit (taxicab distance ).
- `squat()`: Deploy temporary immunity token.
## Playability notes
- **Single-player-vs-AI:** Highly engine-ready — human player controls an evader dodging an algorithmic pursuit AI (e.g., Dijkstra/A* chaser) or plays as Berek optimizing intercept angles.
- **Group games (n>4):** Scales naturally to any agents.
- **Physical-skill games:** Not applicable in discretized mode; agility is mapped directly to discrete movement budget .
- **What is lost:** Real-time physical sprint deceleration, deceptive body feints, and peripheral vision checks.
## Implementation hints
Extremely fast to simulate ( integer coordinate checks). Branching factor: 5 actions for Evaders, 13 for Berek. First milestone: implement the 2D grid with Berek moving at speed 2 and Evaders at speed 1, then layer on the squatting immunity cooldown state machine.
Download as JSON
Download the full game corpus entry for this game as structured JSON.
Download JSONCite this page
Polish Tag (Berek — Squat Tag, Wood Tag & Freeze Tag) (Poland). (n.d.). Games of Countries. https://gamesofcountries.com/games/pl-poland/berek
@misc{gamesofcountries-pl-poland-berek,
title = {Polish Tag (Berek — Squat Tag, Wood Tag & Freeze Tag) (Poland)},
year = {n.d.},
publisher = {Games of Countries},
url = {https://gamesofcountries.com/games/pl-poland/berek}
}