Skip to main content
Formal Specification

Last Pair Splits (Last Couple Out) — Formal Specification

Latvia · chase-tag · Confidence: low

← Back to game page

Implementation Suitability

Suitability: adaptation-requiredFidelity: discretizedGap-fills: 9
# Pēdējais pāris šķiras — AI-optimized specification ## General idea A dynamic column-based pursuit and rendezvous game. Pairs of agents stand in a double column behind a lone forward-facing catcher; upon a call, the rearmost pair uncouples and sprints forward along opposing flanks, racing to reunite and clasp hands in the open space ahead before the catcher can intercept and tag either runner. ## Formal model - **Abstraction taken:** Continuous physical column alignment and flanking sprints are discretized into a 2D corridor grid of size [−W,W]×[0,H]. The column occupies central lanes x∈{−0.5,0.5}; sprinting corridors run along outer lanes x=±2.0. The catcher faces forward with a 180∘ forward vision cone, remaining blind to runners until they cross the catcher's shoulder threshold line y=ycatcher. - **Player/agent count:** 1 catcher agent and 2K runner agents grouped into K pairs (3≤K≤15, odd total count N=2K+1). - **Turn model:** Synchronous discrete-time simulation ticks (simultaneous action selection and resolution). ## Formal rules R1. **Corridor geometry:** Grid [−3,3]×[0,30]. Column pairs occupy y=2,4,6,…,2K. Catcher C stands at (0,2K+4) facing direction +y. [gap-fill] R2. **Sprint trigger:** - On tick 0 of a round, the rearmost pair at y=2 uncouples. - Left runner RL moves into left corridor x=−2.0; Right runner RR moves into right corridor x=2.0 [gap-fill]. - Both runners sprint forward in direction +y with speed vrunner=1.0 unit/tick [gap-fill]. R3. **Catcher perception and pursuit:** - Catcher cannot move or look backward (y<ycatcher). - As soon as either runner's y-coordinate satisfies y≥ycatcher, the catcher activates and chooses a pursuit velocity vector v→c with ‖v→c‖≤vcatcher=1.2 units/tick [gap-fill]. R4. **Rendezvous condition:** - Both runners aim to converge toward rendezvous point (0,ycatcher+6) [gap-fill]. - A successful reunion occurs if distance ‖RL−RR‖≤dclasp=0.8 units [gap-fill]. R5. **Tag condition:** - The catcher successfully tags a runner Ri if ‖C−Ri‖≤dtag=0.8 units before the pair completes a clasp [gap-fill]. R6. **Round outcome and role transfer:** - **Reunion success:** If runners clasp hands before either is tagged: - The reunited pair moves to the head of the column at y=2K+2. - The catcher remains catcher for the next round. - **Tag success:** If the catcher tags runner Rtagged: - The catcher pairs with the untagged runner Rsafe and forms a new pair at the head of the column. - Rtagged becomes the new catcher for the next round [gap-fill]. R7. **Match termination:** Match runs for M=10 round cycles. Scoring tracks cumulative time spent as catcher (lowest time wins) [gap-fill]. ## Edge cases - Tie at the end condition: ranked by lowest cumulative catcher time; ties broken by highest successful reunion rate as runner. - A player with no legal move: not applicable — runners and catcher always have forward/convergent motion vectors. - Repetition / cycles: bounded because runners move monotonically forward along +y; each sprint round provably resolves in <40 ticks. - Simultaneous claims on the same resource or position: if catcher arrives within dtag on the exact same tick that runners achieve dclasp, the reunion clasp takes precedence (runners safe). - Player elimination mid-round: not applicable — total agent count remains constant; pairings dynamically reconstitute. - Resource exhaustion: not applicable — no consumable resources. - Termination guarantee: guaranteed by strictly monotonic forward progress along +y per sprint and fixed match round count M. ## State representation - Persistent state: column pair array, current catcher ID, cumulative catcher time per agent, round index. - Per-turn ephemeral state: coordinates of catcher, coordinates of active sprinting pair (RL,RR), activation state of catcher (dormant vs pursuing), current tick t. - Observable information: - Sprinted runners observe full arena coordinates. - Catcher observes only the forward half-plane y≥ycatcher until activation. - Column pairs observe the ongoing sprint publicly. ## Action space - `sprint_step(vx, vy)`: directional movement vector for active runners (‖v→‖≤1.0) and catcher (‖v→‖≤1.2). - `clasp_hands()`: execute pair reconnection. Precondition: runner distance ≤0.8. ## Playability notes - Single-player-vs-AI: natural — human plays as catcher choosing which flank runner to intercept based on trajectories, or as a flank runner timing angle of convergence with partner AI. - Group games (n>4): natively designed for 7≤N≤31 agents. Reduced to 3 agents (1 catcher vs 1 pair) preserving the core split-and-reunite sprint dynamic without losing strategic essence. - Physical-skill games: sprinting acceleration, backward-looking discipline, and hand-grasping dexterity are abstracted into kinematic speeds, directional thresholds, and proximity clasps. - What is lost: physical rush of wind on the flanks, playful deceptive footwork, and festive matchmaking atmosphere. ## Implementation hints Low complexity. Deterministic 2D corridor grid with simple trigger threshold at y=ycatcher and distance checks for tag vs clasp. First milestone: implement column queue, spawn flank runners, trigger catcher activation, and resolve tag vs clasp race.

Download as JSON

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

Download JSON
Cite this page

Last Pair Splits (Last Couple Out) (Latvia). (n.d.). Games of Countries. https://gamesofcountries.com/games/lv-latvia/pedejais-paris-skiras

@misc{gamesofcountries-lv-latvia-pedejais-paris-skiras,
  title = {Last Pair Splits (Last Couple Out) (Latvia)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/lv-latvia/pedejais-paris-skiras}
}