Formal Specification
Last Pair Out (The Widow's Game) — Formal Specification
Sweden · chase-tag · Confidence: high
← Back to game pageImplementation Suitability
Suitability: adaptation-requiredFidelity: discretizedGap-fills: 5
# Sista paret ut — AI-optimized specification
## General idea
A traditional Swedish social chasing and partner-swapping game based on August Malmström's iconic folklore motif. Players stand in a double column of pairs while a lone "Hunter" (*änkan* / *jägaren*) stands at the front facing away. On the call "Sista paret ut!", the rearmost pair sprints forward down opposite flanks; if the runners clasp hands ahead of the Hunter, they remain paired, but if the Hunter tags one runner first, the Hunter pairs with the tagged runner and the untagged runner becomes the new Hunter.
## Formal model
- **Abstraction taken:** Continuous running physics and hand-clasping contact are discretized onto a 2D spatial grid (). The double column is modeled as static obstacle cells flanking a central corridor. The Hunter's backward-blindness is enforced via a forward-only 180° field-of-view (FOV) sensor. Hand clasping is modeled as two runner agents occupying adjacent cells in the target sanctuary zone ahead of the Hunter.
- **Player/agent count:** agents (benchmark : 1 Hunter , 3 pairs ).
- **Turn model:** Discrete sprint-and-chase rounds (), with each round executing synchronous time ticks ().
## Formal rules
R1. **Setup & Column Formation:**
- The column of pairs occupies fixed positions: Pair 1 at , Pair 2 at , Pair at .
- The Hunter stands at , facing in direction (away from the column).
- The rearmost pair is designated the active runners.
R2. **The Call & Sprint Start:**
- At tick , executes `call_last_pair()`.
- Runners (left flank, ) and (right flank, ) sprint forward in direction at speed [gap-fill].
R3. **Hunter Vision & Activation Trigger:**
- Hunter is locked facing and cannot move or turn while and .
- The moment at least one runner crosses the Hunter's line of sight (), transitions to state `ACTIVE_CHASE` and may move freely in any direction at speed [gap-fill].
R4. **Sanctuary & Hand-Clasping:**
- The runners attempt to converge in the front zone ().
- If at the end of any tick , and neither runner is tagged, the runners successfully clasp hands and achieve `SAFE`.
R5. **Tagging Resolution:**
- If at the end of tick , for runner before the clasp condition is met, runner is `TAGGED`.
- The round terminates immediately upon a tag.
R6. **Role Transfer & Column Update:**
- Case A (Successful Clasp): and remain a pair, taking position at the head of the column (). All other pairs shift back . remains the Hunter for the next round.
- Case B (Hunter Tag on ): and form a new pair at the head of the column (). The untagged runner becomes the new Hunter, moving to .
R7. **Round Limit:**
- [gap-fill] If ticks elapse without a tag or clasp, the runners are ruled to have failed to pair; the runner farther from base becomes the new Hunter.
## Edge cases
- Tie at the end condition: If a clasp occurs on the exact same tick as a tag, priority resolves in favor of the clasp (runners safe) [gap-fill].
- A player with no legal move: Inactive column players are frozen in place; active runners and hunters have unblocked 2D movement.
- Repetition / cycles: Each round is strictly bounded by ticks. A match terminates after rounds with individual partnership scores evaluated [gap-fill].
- Simultaneous claims on the same resource or position: Hand clasping requires adjacency ( cell); multiple agents sharing cells do not create physics lockups.
- Player elimination mid-round: Non-eliminating game; players continuously swap between paired-runner and hunter roles.
- Resource exhaustion (pieces, tokens, space, time): Spatial arena bounded by limits; match bounded by rounds.
- Termination guarantee: Each round terminates in at most 20 ticks. The match terminates after rounds.
## State representation
- **Persistent state:**
- `column_pairs`: list of pairs .
- `current_hunter`: agent ID.
- `round_number`: integer .
- `partnership_score`: map of agent ID .
- **Per-turn ephemeral state:**
- `round_tick`: integer .
- `active_runners`: .
- `hunter_state`: `BLIND_WAITING` or `ACTIVE_CHASE`.
- `positions`: map of active agent IDs .
- **Observable information:**
- Runners observe: positions of each other, the Hunter, and column boundaries.
- Hunter observes: forward half-plane only until triggered, then full local positions.
## Action space
- `call_last_pair()`: executed by Hunter at .
- `move(dx, dy)`: executed by active runners and active Hunter simultaneously each tick.
## Playability notes
- Single-player-vs-AI: Highly playable — human as Hunter predicting runner convergence trajectories, or human as one of the sprinting runners timing flank cuts with an AI partner.
- Group games (n>4): The 7-player game reduces cleanly to a 3-agent form (1 Hunter vs 1 Pair) without altering the fundamental geometry or sighting rules.
- Physical-skill games: Running sprint speed, turning agility, and peripheral visual reaction time are modeled via differential movement speeds () and the -threshold vision trigger.
- What is lost in the adaptation: The flirtatious social courting atmosphere of 19th-century Swedish village dances, physical hand clasping, and August Malmström's romantic aesthetic.
## Implementation hints
Low-to-moderate complexity. The simulation loop is a compact 2D multi-agent kinematic check with an FOV trigger condition. First milestone: implement the forward-only vision trigger for the Hunter and verify that diverging wide flank routes force the Hunter to commit to one runner.
Download as JSON
Download the full game corpus entry for this game as structured JSON.
Download JSONCite this page
Last Pair Out (The Widow's Game) (Sweden). (n.d.). Games of Countries. https://gamesofcountries.com/games/se-sweden/sista-paret-ut
@misc{gamesofcountries-se-sweden-sista-paret-ut,
title = {Last Pair Out (The Widow's Game) (Sweden)},
year = {n.d.},
publisher = {Games of Countries},
url = {https://gamesofcountries.com/games/se-sweden/sista-paret-ut}
}