Skip to main content
Formal Specification

Pinned (Greek Pinning Backgammon) — Formal Specification

Greece · board-race · Confidence: high

← Back to game page

Implementation Suitability

Suitability: engine-readyFidelity: directGap-fills: 2
# Plakoto — AI-optimized specification ## General idea A discrete, two-player race and pinning board game played on a 24-point linear graph with counter-flowing paths. All 15 checkers per player start on a single corner point. Checkers cannot be hit to a bar; instead, landing on a single opposing checker pins and immobilizes it. Pinning the opponent's final starting checker ("Mana") wins immediately. ## Formal model - **Abstraction taken:** None required (`fidelity_class: direct`). Board modeled as 24 ordered points with point-stack arrays tracking checker ownership, pin layers, and off-board bearing tallies. - **Player/agent count:** 2 agents (Player 0 moving 1→24, Player 1 moving 24→1). - **Turn model:** Sequential alternating turns. Each turn begins with rolling 2 independent d6 dice (4 moves on doubles). ## Formal rules R1. Setup: - 24 points. Player 0 has 15 checkers stacked on point 1 (home quadrant: 19..24). - Player 1 has 15 checkers stacked on point 24 (home quadrant: 6..1). - Point 1 bottom checker is P0's Mana; Point 24 bottom checker is P1's Mana. R2. On a turn, roll D=(d1,d2) uniformly from {1..6}2. If d1=d2, roll expands to 4 identical moves. R3. Movement & Pinning rules: - Target point p′=p+die (for P0) or p−die (for P1). - Target legality: - Point p′ is empty → Legal. - Point p′ has friendly checkers (pinned or unpinned) → Legal. - Point p′ has exactly 1 opponent checker (unpinned) → Legal; the active checker lands on top, creating a "pin". The pinned piece cannot move. Point ownership transfers to active agent. - Point p′ has ≥2 opponent checkers or an opponent-controlled pin → Illegal. - Pinned pieces: Only the topmost checker of a stack can move. A pinned bottom checker is immobile until the top piece leaves. R4. Mana Pin Instant Win: - If Player 0 pins Player 1's Mana while it is still on Point 24, Player 0 wins 2 points immediately, unless Player 1 has also pinned Player 0's Mana on Point 1 (which results in a 0-point draw). - Symmetric condition applies for Player 1 pinning Player 0's Mana on Point 1. R5. Bearing off: - Precondition: All 15 friendly checkers are in the home quadrant (19..24 for P0, 6..1 for P1) and ZERO friendly checkers are pinned anywhere on the board. - Bearing off follows standard exact-match or highest-occupied point rules. R6. [gap-fill] Mandatory move usage: A player must use as many dice as legally possible, prioritizing the larger die if only one can be played. R7. Win condition: - Bearing off all 15 checkers first wins (1 point if opponent has borne off ≥1; 2 points if opponent has borne off 0). - Mana pin wins 2 points immediately per R4. ## Edge cases - Tie at the end condition: Possible exclusively if both players' Manas are simultaneously pinned on their original starting points (evaluates to a formal Draw). - A player with no legal move: Unused dice are forfeited and turn passes immediately to the opponent. - Repetition / cycles: Bounded — checkers cannot move backward. Since checkers advance monotonically toward home quadrants, cycles are impossible. - Simultaneous claims on the same resource or position: Not applicable — sequential turns. - Player elimination mid-round; turn order repair: Not applicable (strictly 2 agents). - Resource exhaustion: Conserved checker count (N=30) and fixed 24-point topology. - Termination guarantee: Monotonic progress without retrograde motion guarantees termination in finite steps. [gap-fill] Hard move cap at 300 plies terminates in a draw if reached. ## State representation - Persistent state: - `points`: Array of 24 stacks (each stack is a list of checker owner IDs, e.g. `[0]`, `[1, 0]` where 0 is pinned by 1, or `[0, 0, 0]`). - `off`: Array of 2 integers `[p0_off, p1_off]`. - `mana_pinned`: Array of 2 booleans `[p0_mana_pinned, p1_mana_pinned]`. - `turn`: Active agent (0 or 1). - `ply_count`: Integer counter. - Per-turn ephemeral state: - `dice_remaining`: List of available die values. - Observable information: Fully observable. ## Action space - `move(from_point, die_value)`: Advance top checker from `from_point` (1..24) by `die_value`. - `pass()`: Valid only if no legal moves exist. ## Playability notes - Single-player-vs-AI: Engine-ready. State evaluation is straightforward: weights on checker advancement, pins inflicted, pins suffered, and Mana safety. - Group games (n>4): Not applicable (strictly 2 players). - Physical-skill games: Not applicable. - What is lost: Physical tension of holding/slamming checkers and table-talk psychology. ## Implementation hints - Point stack representation: Represent each of the 24 points as a small fixed array or bitfield tracking base owner, pin count, and top owner. - Branching factor: Average 8–20 legal actions per turn. - First milestone: Board representation handling pin stacks, unpinning on departure, and Mana capture detection.

Download as JSON

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

Download JSON
Cite this page

Pinned (Greek Pinning Backgammon) (Greece). (n.d.). Games of Countries. https://gamesofcountries.com/games/gr-greece/tavli-plakoto

@misc{gamesofcountries-gr-greece-tavli-plakoto,
  title = {Pinned (Greek Pinning Backgammon) (Greece)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/gr-greece/tavli-plakoto}
}