Skip to main content
Formal Specification

Icelandic Tables — Formal Specification

Iceland · board-race · Confidence: low

← Back to game page

Implementation Suitability

Suitability: engine-readyFidelity: directGap-fills: 4
# Kotra — AI-optimized specification ## General idea A traditional Icelandic tables-family race board game played on a 24-point board with 15 pieces per player and two six-sided dice. Unlike standard backgammon, both players advance their pieces in the exact same direction along a parallel 24-point track from point 1 toward point 24, competing to enter all pieces, secure fortified points (*band*), strike isolated enemy blots (*blott*), and bear off their entire army first. ## Formal model - **Abstraction taken:** None — the traditional rules constitute a fully discrete stochastic race game. Formalization only specifies die forfeiture on blockage and maximum turn limits. - **Player/agent count:** 2 players (Player 1 and Player 2). - **Turn model:** Strictly alternating sequential turns with stochastic die rolls. ## Formal rules R1. Setup: Board consists of 24 triangular points indexed 1 to 24 along a single unidirectional track, divided by a central bar. Home quadrant is points 19 to 24. Each player begins with 15 counters off the board (in the entry pool). R2. Turn structure: On a turn, the active player rolls two standard six-sided dice (D6, values 1–6). If distinct values (d1,d2) are rolled, the player has 2 move allowances of lengths d1 and d2. If doubles (d,d) are rolled (*tvístirni*), the player receives 4 move allowances of length d. R3. Entry onto the board: A piece in the entry pool must enter onto point k (where k∈[1..6] is an available die value) before moving further down the board. R4. Bar re-entry priority: If a player has any piece on the central bar (struck piece), that player must re-enter all bar pieces onto points 1–6 using available dice before any piece already on the board may be moved. R5. Movement along track: An active piece on point p moves forward to point p+d, where d is an available die value. Both players move in the same direction (from point 1 toward point 24). R6. Fortified points (*Band*): A point occupied by 2 or more pieces of the same color is a *band* (closed point). An opposing piece cannot land on or occupy a point holding an opponent's band. Multiple friendly pieces may stack on any point without limit. R7. Striking a blot (*Reka blott*): A point occupied by exactly 1 piece is a blot (*blott*). If an opponent lands on that point, the occupying piece is struck, removed from the board, and placed on the central bar. R8. Forfeiture of illegal moves: If a player cannot legally execute one or more die values due to blocked points or bar-entry requirements, the unplayable dice are forfeited [gap-fill] and the turn ends. R9. Bearing off (*Bera út*): When all 15 of a player's pieces are located in the home quadrant (points 19–24), the player may bear pieces off the board. A die value d allows bearing off a piece from point 25−d. If a die value exceeds the highest occupied point and no pieces remain on higher points, the player may bear off a piece from the highest occupied point [gap-fill]. If a piece is struck while bearing off, bearing off is frozen until the struck piece re-enters and travels back to points 19–24. R10. Win conditions: - The first player to bear off all 15 pieces wins the match. - Single victory (*einfaldur sigur*): Opponent has borne off at least 1 piece. - Double victory (*jan*): Opponent has borne off 0 pieces. - Triple victory (*stórt jan*): Opponent has borne off 0 pieces and has no pieces in the home quadrant. - [gap-fill] A turn limit of 300 turns without bearing off terminates the game as a draw. ## Edge cases - Tie at the end condition: Not applicable — turns are sequential; the first player to bear off the 15th piece wins immediately. - A player with no legal move: Covered in R8; unplayable die rolls are forfeited without penalty. - Repetition / cycles: Continuous striking of blots could theoretically produce cycles, but the stochastic progression on a finite Markov chain combined with the R10 [gap-fill] turn limit guarantees termination. - Simultaneous claims on the same resource or position: Not applicable — sequential turns; landing on a single piece strikes it; landing on a band (≥2 pieces) is illegal. - Player elimination mid-round; turn order repair: Not applicable — exactly 2 players; all pieces remain in play or bar until borne off. - Resource exhaustion: 15 pieces per player, 24 points; dice rolled fresh each turn. - Termination guarantee: Guaranteed by the absorbing state of bearing off 15 pieces in a finite-state Markov decision process with non-zero probability of advancement on every roll. ## State representation - Persistent state: - `board`: array of 24 points, each storing `(owner: {NONE, P1, P2}, count: int)`. - `bar`: count of pieces on bar for `P1` and `P2`. - `entry_pool`: count of unentered pieces for `P1` and `P2`. - `borne_off`: count of pieces removed for `P1` and `P2`. - `turn`: `{P1, P2}`. - `turn_counter`: integer count. - Per-turn ephemeral state: - `dice_rolled`: list of available integer moves `[d1, d2]` (or 4 values for doubles). - `dice_remaining`: subset of unspent moves. - Observable information: - Complete information; all piece positions, bar contents, entry counts, and dice rolls are fully visible to both players. ## Action space - `enter_piece(die_val)`: Move piece from entry pool or bar to point `die_val`. - `move_piece(from_point, die_val)`: Move piece from `from_point` to `from_point + die_val`. - `bear_off(from_point, die_val)`: Remove piece from `from_point` off the board. - `pass_turn()`: Forfeit remaining unplayable dice when no legal moves exist. ## Playability notes - Single-player-vs-AI: Natural — standard expectiminimax or reinforcement learning (TD-Gammon architecture) applies directly. - Group games (n>4): Not applicable — strictly 1v1. - Physical-skill games: Not applicable — pure discrete stochastic board game. - What is lost in the adaptation: None; the historical parallel-track movement, Icelandic *band* blocking, and *jan* scoring are modeled with full mathematical fidelity. ## Implementation hints - Represent points as positive/negative integers for P1/P2 piece counts on a 24-element array. - Action generation must strictly enforce bar re-entry before standard board moves. - Suggested first milestone: implement die rolling (including doubles expansion), move validation respecting bands, blot striking to bar, and bearing off logic.

Download as JSON

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

Download JSON
Cite this page

Icelandic Tables (Iceland). (n.d.). Games of Countries. https://gamesofcountries.com/games/is-iceland/kotra

@misc{gamesofcountries-is-iceland-kotra,
  title = {Icelandic Tables (Iceland)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/is-iceland/kotra}
}