Skip to main content
Formal Specification

Last pair out of the oven — Formal Specification

Finland · chase-tag · Confidence: high

← Back to game page

Implementation Suitability

Suitability: engine-readyFidelity: discretizedGap-fills: 3
# Viimeinen pari uunista ulos — AI-optimized specification ## General idea A traditional Finnish pair-racing and partner-stealing tag game. Players stand in a long double column of paired couples holding hands. A solitary "catcher" (*huutaja / leski* / "widower") stands in front of the column with their back turned. When the catcher shouts the traditional command *"Viimeinen pari uunista ulos!"* (Last pair out of the oven!), the rear-most pair splits and sprints forward along opposite sides of the column. The runners attempt to reunite and clasp hands in front of the catcher, while the catcher attempts to tag either runner to steal a partner and escape the catcher role. ## Formal model - **Abstraction taken:** The continuous double column formation and sprinting field are discretized into a 2D grid where the column occupies a central strip X∈[xleft,xright] along the longitudinal axis. Sprinting runners choose wide lateral evasion paths around the column, and hand clasping is modeled as two runners reaching adjacent cells in front of the catcher. - **Player/agent count:** N agents (N=2K+1, where K≥2 is the number of pairs; 5≤N≤31). Configured as 1 Catcher and K ordered pairs (P1,left,P1,right)…(PK,left,PK,right). - **Turn model:** Round-based discrete ticked execution. ## Formal rules R1. **Column Formation & Setup:** - Double column of K pairs arranged from front (rank 1) to rear (rank K). - Catcher stands at (x0,y0) in front of rank 1, facing forward (+y direction), unable to look backward (zero rear vision). R2. **The Call and Release:** - The Catcher executes `call_last_pair()`. - The rear pair at rank K (Rleft and Rright) are released from the column and begin sprinting forward along their respective sides. - Catcher is immobilized and cannot turn around until either runner crosses the Catcher's line (y≥y0). R3. **The Chase & Hand Clasping:** - Once a runner crosses y≥y0, the Catcher is activated and may move freely to chase either runner. - **Runners' Goal:** Rleft and Rright must move into adjacent cells in front of the Catcher and execute `join_hands()`. - **Catcher's Goal:** The Catcher must enter the cell of or an orthogonally adjacent cell to either Rleft or Rright and execute `tag()`. R4. **Round Resolution & Role Update:** - **Case 1 (Pair Reunited):** If the runners execute `join_hands()` before either is tagged: - The pair remains intact. - They walk to rank 1 (front of the column), shifting all other pairs back one rank (1…K−1→2…K). - The Catcher remains Catcher for the next round. - **Case 2 (Catcher Tags Runner):** If the Catcher tags runner Rtagged: - The Catcher and Rtagged form a new pair and take rank 1 at the front of the column. - The untagged runner Rfree becomes the new Catcher for the next round. R5. **Action Conflicts:** [gap-fill] If on the same tick the Catcher reaches Rtagged while both runners execute `join_hands()`, the runners' hand clasp resolves first, nullifying the tag (runner precedence). R6. **Match Scoring:** [gap-fill] In a formal match of M=20 pair calls, the player who spent the fewest cumulative rounds in the `Catcher` role is declared the winner. ## Edge cases - **Tie at the end condition:** Handled by R6 (fewest rounds as Catcher; broken by fewest times tagged). - **A player with no legal move:** Column pairs execute `noop` until called. Active sprinters always have movement/clasp actions. - **Repetition / cycles:** Role swaps cycle continuously; match terminates strictly upon completing M rounds. - **Simultaneous claims on the same resource or position:** Handled by R5. Column members occupy fixed grid slots. - **Player elimination mid-round; turn order repair:** Not applicable — no player elimination; pairs and catchers continuously cycle through column ranks. - **Resource exhaustion (pieces, tokens, space, time):** Total player count 2K+1 is invariant. Rounds capped at M. - **Termination guarantee: why the game provably ends:** Each sprint round terminates in finite ticks (runners must advance forward or be caught within Tround≤100 ticks [gap-fill]), and total rounds are capped at M. ## State representation - **Persistent state:** Total pairs K; ordered list of column pairs (1…K); active Catcher ID; round counter m∈[1,M]; cumulative rounds spent as Catcher per agent. - **Per-round state:** Active sprinting pair IDs; coordinates of all agents; Catcher activation status ∈{waiting,chasing}; tick counter t. - **Observable information:** Fully observable game state (except Catcher's rear vision before runners cross y0). ## Action space - `call_last_pair()`: (Catcher only, when waiting). - `move(dx, dy)`: (Active runners and chasing Catcher). - `join_hands()`: (Active runners only, valid when adjacent). - `tag(target_id)`: (Catcher only, valid when adjacent). - `noop()`: (Stationary column pairs). ## Playability notes - **Single-player-vs-AI:** Highly playable. Human plays as Catcher pursuing AI runners taking varied flanking arcs, or plays as a sprinting runner coordinating timing with an AI partner. - **Group games (n>4):** Standard format uses 5 to 31 players. Reduces cleanly to 3 agents (1 Catcher + 2 Runners) with an automated column conveyor. - **Physical-skill games:** Physical acceleration, dodging curves, and arm-grasping accuracy are abstracted into discrete speed budgets and adjacency collision checks. - **What is lost in the adaptation:** The festive social banter, the physical sensation of swinging hands in the column, and the comedic spectacle of wide flanking sprints around cheering spectators. ## Implementation hints - Model the column as a double-ended queue (deque) of pairs. - Branching factor: 9 movement choices for active runners and catcher; stationary pairs execute deterministic `noop`. - Suggested first milestone: Implement a 10×20 grid with 1 Catcher and 1 sprinting pair (2 static pairs in column), verifying that a successful `join_hands()` moves the pair to rank 1 without swapping the Catcher.

Download as JSON

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

Download JSON
Cite this page

Last pair out of the oven (Finland). (n.d.). Games of Countries. https://gamesofcountries.com/games/fi-finland/viimeinen-pari-uunista-ulos

@misc{gamesofcountries-fi-finland-viimeinen-pari-uunista-ulos,
  title = {Last pair out of the oven (Finland)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/fi-finland/viimeinen-pari-uunista-ulos}
}