Formal Specification
Janzeer (The Chain) — Formal Specification
Palestine · chase-tag · Confidence: high
← Back to game pageImplementation Suitability
Suitability: engine-readyFidelity: discretizedGap-fills: 4
# Al-Janzeer — AI-optimized specification
## General idea
A dynamic expanding-chain tag game on a 2D bounded arena. One initial catcher tags free runners. Each tagged player links hands with the catcher, forming an elongated contiguous chain that must sweep the arena in coordination. Only the two outer extremities of the chain can tag free runners, while chain breaks invalidate captures.
## Formal model
- **Abstraction taken:** Hand-linking is modeled as an ordered list of connected adjacent grid coordinates subject to connectivity constraints (). Arena is a bounded 2D grid.
- **Player/agent count:** 6 to 20 agents (1 initial Catcher, Free Runners).
- **Turn model:** Synchronized simultaneous ticks (e.g. 1 tick = 1 discrete grid step).
## Formal rules
R1. **Initial state:** Agent is the solitary chain . All other agents are free runners scattered in the arena.
R2. **Chain movement:**
- Each tick, the chain moves as a connected worm/snake. Head steps to an adjacent cell, and subsequent segments follow along the path.
- If distance , the chain is **broken**.
R3. **Tagging constraint:**
- Only the Head () and Tail () can execute `tag(runner_id)` on adjacent free runners.
- Tags are strictly **invalid** if the chain is currently broken.
R4. **Chain expansion:**
- When a runner is tagged by a valid chain end, they are captured and appended to the chain at that extremity, increasing .
R5. [gap-fill] Surrounding capture:** If free runners are trapped in an enclosed cycle formed by the chain, all encircled runners are captured simultaneously.
R6. **Victory:** Game terminates when (all players captured). The last free runner captured is declared the individual winner and starts as the Head in the next round.
R7. [gap-fill] Time limit:** Maximum 200 ticks per match.
## Edge cases
- **Tie at the end condition:** If multiple runners are captured on the same tick to complete the chain, tiebreaker resolves by longest total survival distance [gap-fill].
- **A player with no legal move:** Trapped runners must remain in their cell.
- **Repetition / cycles:** Bounded by 200-tick cutoff [gap-fill].
- **Simultaneous claims:** Collision resolved by coordinate occupancy rules.
- **Player elimination mid-round:** Runners are not eliminated; they transform into chain segments.
- **Resource exhaustion:** Arena bounds are fixed.
- **Termination guarantee:** Guaranteed by monotonic chain growth ( increases) and 200-tick cap.
## State representation
- **Persistent state:** `arena_size: (M, N)`, `total_players: int`.
- **Ephemeral state:** `chain: List[AgentID]`, `free_runners: Set[AgentID]`, `positions: Dict[AgentID, (x,y)]`, `chain_broken: bool`.
- **Observable information:** Fully observable state.
## Action space
- `move_runner(dx, dy)`: Free runner evasive step.
- `move_chain_head(dx, dy)`: Dictates chain leading trajectory.
- `tag(runner_id)`: Executed by chain head or tail on adjacent coordinate.
## Playability notes
- **Single-player-vs-AI:** Operates as an arcade evasion game (avoiding the growing snake) or snake-steering capture puzzle.
- **Group games (n>4):** Native multi-agent team coordination benchmark.
- **Physical-skill games:** Physical hand-holding grip strength mapped to adjacency connectivity checks.
- **What is lost:** Tactile hand pulls, physical pulling momentum, and breathless laughter.
## Implementation hints
Standard multi-segment snake kinematics combined with pursuit-evasion grid agents.
Download as JSON
Download the full game corpus entry for this game as structured JSON.
Download JSONCite this page
Janzeer (The Chain) (Palestine). (n.d.). Games of Countries. https://gamesofcountries.com/games/ps-palestine/janzeer
@misc{gamesofcountries-ps-palestine-janzeer,
title = {Janzeer (The Chain) (Palestine)},
year = {n.d.},
publisher = {Games of Countries},
url = {https://gamesofcountries.com/games/ps-palestine/janzeer}
}