Formal Specification
The Black Man (Who is afraid of the Black Man? / Cross-field tag) — Formal Specification
Finland · chase-tag · Confidence: high
← Back to game pageImplementation Suitability
Suitability: engine-readyFidelity: discretizedGap-fills: 3
# Musta mies — AI-optimized specification
## General idea
A classical cross-field charging tag game. One player begins as the lone catcher in the center of an open field flanked by two safe baseline zones. Upon a formal call-and-response signal, all free runners must sprint across the open field to reach the opposite sanctuary line. Anyone tagged during the dash converts into an assistant catcher for all future waves, creating an exponentially expanding defensive wall until only one runner survives.
## Formal model
- **Abstraction taken:** Continuous physical sprinting and hand tagging across an open court are discretized into a bounded 2D grid running longitudinally from Goal Line () to Goal Line (). Rounds consist of alternating directional waves (, then ).
- **Player/agent count:** agents (). Initial configuration: 1 Catcher, Runners.
- **Turn model:** Wave-based simultaneous discrete ticks. Within each wave, all active agents commit movement vectors each tick until all runners have reached safety or been tagged.
## Formal rules
R1. **Arena & Geometry:** A 2D grid of size .
- Safety Zone .
- Safety Zone .
- Open Field .
R2. **Wave Initialization:**
- Wave 1 starts at Zone . All runners begin in Zone . The Catcher begins in Open Field (e.g. ).
- A wave start signal is broadcast.
R3. **Charge & Movement Constraints:**
- All active runners must move toward the destination safety zone ( on odd waves, on even waves).
- [gap-fill] Anti-stalling rule: On each tick within a wave, a runner must advance at least 1 grid unit along the longitudinal axis toward the target zone (backward retreats into the departure safety zone are prohibited).
- Catchers may move in any direction within Open Field . Catchers cannot enter Safety Zones or .
R4. **Tagging & Conversion:**
- If a Catcher enters the same cell as or an orthogonally adjacent cell to an active Runner within Open Field , that Runner is tagged.
- [gap-fill] A tagged runner is immediately converted to role `Catcher` starting on the subsequent wave.
- If a runner reaches the destination Safety Zone without being tagged, the runner is `safe` for that wave.
R5. **Wave Resolution:**
- A wave concludes when every active runner has either reached the destination Safety Zone or been tagged.
- Direction of the next wave is inverted ( or ).
R6. **Victory & End Condition:**
- The game terminates when exactly 1 runner remains uncaught (all other players are Catchers).
- That final surviving runner is declared the sole winner.
## Edge cases
- **Tie at the end condition:** [gap-fill] If the last 2 remaining runners are tagged on the exact same tick in a wave, the runner with the higher Euclidean distance from the nearest catcher at the moment of contact is declared the winner; if equal, a shared victory is recorded.
- **A player with no legal move:** Catchers and runners always have legal movement choices within their speed limits and directional constraints.
- **Repetition / cycles:** Impossible — each wave forces monotonic longitudinal advancement toward the opposite goal line in finite ticks ( ticks).
- **Simultaneous claims on the same resource or position:** Multiple runners and catchers can occupy the same cell; if a catcher and runner occupy the same cell, tag resolution triggers.
- **Player elimination mid-round; turn order repair:** Runners are not eliminated from the simulation; their role transitions from `Runner` to `Catcher` on the next wave.
- **Resource exhaustion (pieces, tokens, space, time):** Grid dimensions and total player count are fixed. Waves strictly deplete the runner population toward 1.
- **Termination guarantee: why the game provably ends:** Since catchers increase monotonically with each wave while runners strictly decrease, and each wave is bounded by ticks, the game is guaranteed to terminate in at most waves.
## State representation
- **Persistent state:** Grid bounds ; total players ; wave number ; current target zone ; active roles of all agents .
- **Per-wave ephemeral state:** Wave tick counter ; coordinates of all agents; list of runners tagged in current wave.
- **Observable information:** Fully observable game state.
## Action space
- `move(dx, dy)`: where , subject to forward progress constraint for runners in field .
## Playability notes
- **Single-player-vs-AI:** Highly playable. Human plays solitary runner evading a growing swarm of AI catchers, or plays the initial catcher coordinating interception angles.
- **Group games ():** Reduces naturally to 2 agents by having Agent 1 control the Runner and Agent 2 control all Catchers as a collective defense swarm.
- **Physical-skill games:** Physical sprinting speed and dodging agility are abstracted into grid step limits and forward-progress vectors.
- **What is lost in the adaptation:** The adrenaline rush of 20 children charging simultaneously across a grass field, and the vocal call-and-response dialogue.
## Implementation hints
- Model as an episodic grid environment where each episode runs waves until 1 runner remains.
- Branching factor: movement choices per agent; for a 2-agent reduction (Runner vs Catchers), branching factor is or .
- Suggested first milestone: Implement a 10×20 grid with 1 Catcher and 4 Runners across 3 waves, verifying that tagged runners correctly transition to catchers on subsequent waves.
Download as JSON
Download the full game corpus entry for this game as structured JSON.
Download JSONCite this page
The Black Man (Who is afraid of the Black Man? / Cross-field tag) (Finland). (n.d.). Games of Countries. https://gamesofcountries.com/games/fi-finland/musta-mies
@misc{gamesofcountries-fi-finland-musta-mies,
title = {The Black Man (Who is afraid of the Black Man? / Cross-field tag) (Finland)},
year = {n.d.},
publisher = {Games of Countries},
url = {https://gamesofcountries.com/games/fi-finland/musta-mies}
}