Skip to main content
Formal Specification

Escape (Greek Running Backgammon) — Formal Specification

Greece · board-race · Confidence: high

← Back to game page

Implementation Suitability

Suitability: engine-readyFidelity: directGap-fills: 2
# Fevga — AI-optimized specification ## General idea A discrete, two-player race board game played on a 24-point circular topology where both players move in the same counter-clockwise direction from diagonally opposite starting positions. There are no captures or pins: a single checker claims and closes a point against the opponent. Players must clear a lead checker past the opponent's base before releasing other pieces, balancing rapid progression against six-point blockades ("primes"). ## Formal model - **Abstraction taken:** None (`fidelity_class: direct`). 24 points ordered modulo 24, with unidirectional movement and binary point-occupancy ownership. - **Player/agent count:** Exactly 2 agents (Player 0 and Player 1). - **Turn model:** Sequential alternating turns with 2d6 roll (4 moves on doubles). ## Formal rules R1. Setup: - 24 points labeled 0..23 arranged in a directed ring with forward step p→(p+1)(mod24). - Player 0: 15 checkers stacked on point 23. Home quadrant is points 17..22. - Player 1: 15 checkers stacked on point 11. Home quadrant is points 5..10. R2. Opening Gate Rule: - Player 0 must move their first checker past point 11 before any other checker at point 23 may move. - Player 1 must move their first checker past point 23 before any other checker at point 11 may move. R3. Dice & Move Generation: - Turn begins with roll D=(d1,d2)∈{1..6}2. If d1=d2, active agent receives four moves of value d1. R4. Movement & Point Ownership: - A checker on point p moves to target point p′=(p+die)(mod24). - Legality check: - Point p′ has 0 opposing checkers → Legal (even if occupied by friendly checkers). - Point p′ has ≥1 opposing checkers → Illegal (blocked). R5. Blockade / Prime Constraints: - A player can construct a continuous block of 6 points ("six-prime"). - [gap-fill] If a player constructs a six-prime that traps all remaining opponent checkers with no open point ahead, the player must not extend or maintain the full six-prime if a legal move exists to open a point, preventing permanent deadlock. R6. Bearing off: - Precondition: All 15 friendly checkers have entered the agent's designated home quadrant (17..22 for P0, 5..10 for P1). - Bearing off follows standard exact-match or highest-occupied point rules. R7. Win condition: - First agent to bear off all 15 checkers wins (1 point if opponent has borne off ≥1; 2 points if opponent has borne off 0). ## Edge cases - Tie at the end condition: Not applicable — sequential turns ensure a single winner bears off the 15th checker first. - A player with no legal move: If dice rolls are completely blocked by opposing points, all unused dice are forfeited and turn passes immediately. - Repetition / cycles: Bounded — checkers cannot move backward, and must make a fixed single circuit around the board before bearing off. Checkers never cycle infinitely. - Simultaneous claims on the same resource or position: Not applicable — sequential turns and binary ownership per point. - Player elimination mid-round; turn order repair: Not applicable (strictly 2 agents). - Resource exhaustion: Conserved checker count (N=30) and fixed ring graph. - Termination guarantee: Monotonic forward movement around the 24-point ring guarantees termination in finite turns. [gap-fill] Hard 300-ply timeout adjudicates a draw if reached. ## State representation - Persistent state: - `board`: Array of 24 integers (positive for P0 checkers, negative for P1 checkers, 0 for empty). - `off`: Array of 2 integers `[p0_off, p1_off]`. - `lead_cleared`: Array of 2 booleans `[p0_lead_cleared, p1_lead_cleared]`. - `turn`: Active player index (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)`: Move one checker from `from_point` (0..23) forward by `die_value`. - `pass()`: Valid only if no legal moves exist. ## Playability notes - Single-player-vs-AI: Engine-ready. Highly strategic search problem well-suited for minimax with alpha-beta pruning or MCTS. - Group games (n>4): Not applicable (strictly 2 players). - Physical-skill games: Not applicable. - What is lost: The tactile rhythm and board tapping of Greek kafenion culture. ## Implementation hints - Represent circular arithmetic cleanly with modulo 24. - Track the `lead_cleared` flag explicitly to enforce R2. - Branching factor: Typically 5–18 legal moves per roll.

Download as JSON

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

Download JSON
Cite this page

Escape (Greek Running Backgammon) (Greece). (n.d.). Games of Countries. https://gamesofcountries.com/games/gr-greece/tavli-fevga

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