Skip to main content
Formal Specification

Two Men Forward for a Widow / The Widow Game — Formal Specification

Denmark · chase-tag · Confidence: high

← Back to game page

Implementation Suitability

Suitability: engine-readyFidelity: discretizedGap-fills: 6
# To mand frem for en enke — AI-optimized specification ## General idea A structured coupling chase game played by an odd number of agents arranged in a paired column behind a single tagger ("widow"). When the widow calls the signal, the rearmost pair disengages and races along opposite flanks toward a rendezvous point ahead of the widow, while the widow attempts to intercept and tag either runner before their hands clasp. ## Formal model - **Abstraction taken:** Continuous running space is mapped to a discrete 2D grid (W×L) with fixed movement points per tick. The physical hand-clasp is formalized as both runners occupying adjacent cells and executing a simultaneous `clasp()` action. - **Player/agent count:** N=2k+1 agents (1 widow W, k≥3 pairs [Ri,1,Ri,2]). - **Turn model:** Real-time ticked synchronous movement (tick length = 100 ms). ## Formal rules R1. Setup: k pairs form a double column facing forward behind widow W, who stands dstart=4 grid units ahead of the foremost pair facing away (θ=0∘). R2. Round start: W executes `call_run()`. The rearmost pair (i=k) transitions from `QUEUED` to `RUNNING` status. R3. [gap-fill] Vision constraint: W is stationary and cannot observe or turn until at least one runner's y-coordinate satisfies yrunner≥yW. R4. Once triggered by R3, W enters `PURSUIT` state and may move at speed vW=1.0 units/tick, while runners move at vR=1.1 units/tick. R5. Tag condition: If W moves into an orthogonally adjacent cell to any runner R before the pair clasps, W can execute `tag(R)`. R6. Clasp condition: If Rk,1 and Rk,2 occupy cells with Manhattan distance ≤1 at y>yW and both execute `clasp()`, the runners succeed. R7. State transition on Clasp: Runners become the new front pair (i=1), all existing pairs shift down by 1 position (i←i+1), and W remains widow. R8. State transition on Tag: The tagged runner becomes the new widow W′; the former widow W pairs with the untagged runner to become pair i=1; all pairs shift down (i←i+1). R9. [gap-fill] A maximum tick budget Tmax=150 ticks is enforced per sprint. If neither clasp nor tag occurs within Tmax, W is awarded the tag on the closer runner. ## Edge cases - Tie at the end condition: If a `tag()` and a `clasp()` occur on the identical simulation tick, [gap-fill] `clasp()` takes precedence. - A player with no legal move: Not applicable; runners have open perimeter lanes and W has an open forward half-plane. - Repetition / cycles: The game is played as repeated rounds without a singular terminal win state; termination of a match is governed by an agreed fixed round limit M [gap-fill]. - Simultaneous claims on the same resource or position: Grid cell collision between runners is prohibited; movement to an occupied cell is blocked. - Player elimination mid-round; turn order repair: No elimination; if an agent disconnects, the unpaired runner is either assigned a bot partner or the column reduces by one pair [gap-fill]. - Resource exhaustion: No physical consumables; state space is bounded by grid dimensions and player count. - Termination guarantee: Guaranteed by per-sprint timeout Tmax (R9) and round counter limit M. ## State representation - Persistent state: Ordered list of pairs P1,…,Pk, identifier of widow W, score matrix / rounds won per agent, round counter m. - Per-turn ephemeral state: Agent (x,y) coordinates, orientations θ, velocity vectors, active runner identifiers, sprint tick timer t. - Observable information: Full spatial positions of all agents except W, who observes only agents in front of its forward visual plane (y>yW). ## Action space - `call_run()`: Executed by W in idle state to initiate the sprint. - `move(dx, dy)`: Unit grid displacement for active runners and W. - `tag(target_id)`: Executed by W against an adjacent runner. - `clasp()`: Executed by active runners when within range. ## Playability notes - Single-player-vs-AI: Natural; player controls either the widow chasing heuristic AI runners or one of the runners coordinating with an AI partner. - Group games: Easily scales to 15+ agents; non-active queued pairs act as static boundary obstacles defining the corridor. - Physical-skill games: Physical sprint acceleration is parameterized by agent stamina and speed attributes [gap-fill]. - What is lost: The visceral thrill of physical hand-grasping and evasion is reduced to geometric path-planning and proximity checks. ## Implementation hints Low algorithmic complexity. Main requirement is a 2D spatial collision grid and a basic pathfinder / pursuer-evader controller for bot agents. Recommended milestone: simulate a single sprint cycle between 2 runners and 1 pursuer before implementing the full rotating pair queue.

Download as JSON

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

Download JSON
Cite this page

Two Men Forward for a Widow / The Widow Game (Denmark). (n.d.). Games of Countries. https://gamesofcountries.com/games/dk-denmark/to-mand-frem-for-en-enke

@misc{gamesofcountries-dk-denmark-to-mand-frem-for-en-enke,
  title = {Two Men Forward for a Widow / The Widow Game (Denmark)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/dk-denmark/to-mand-frem-for-en-enke}
}