Skip to main content
Formal Specification

Tab — Formal Specification

Palestine · board-race · Confidence: low

← Back to game page

Implementation Suitability

Suitability: engine-readyFidelity: directGap-fills: 3
# Al-Tab — AI-optimized specification ## General idea An ancient Middle Eastern race-and-capture war game played on a 4×N grid of holes/squares (typically 4×16 or 4×24). Players use 4 split palm-branch casting sticks (*Tab*) as binary dice to convert raw pieces (*Nasar*) into active soldiers (*Khayyal*), maneuver along boustrophedon paths across four rows, stack friendly pieces into armies, and capture opponent pieces. ## Formal model - **Board structure:** 4 parallel rows of C=16 cells each (Rows 1 and 2 belong to Player 1's camp; Rows 3 and 4 belong to Player 2's camp). - **Player/agent count:** 2 players (or 2 teams), each controlling C pieces starting on their outer home row. - **Turn model:** Alternating turns. Rolling a *Tab* (value 1) or *Bara* grants an extra roll. ## Formal rules R1. **Casting sticks:** 4 two-sided sticks thrown together. Let w be the number of white faces showing: - w=1⟹Tab (value 1 + activates piece + grants bonus throw) - w=2⟹Ithnayn (value 2) - w=3⟹Thalatha (value 3) - w=4⟹Arba’a (value 4 + grants bonus throw) - w=0⟹Sitteh (value 6 + grants bonus throw) R2. **Piece activation:** Pieces start as inactive "Christians/Raw pieces" (*Nasar*). A piece cannot move until activated into a "Knight" (*Khayyal*) by expending a rolled *Tab* (1). R3. **Boustrophedon path:** Active pieces advance along a predetermined serpentine route: outer home row → inner home row → inner enemy row → outer enemy row. R4. **Stacking & capturing:** - Landing on a friendly active piece allows stacking into a united brigade (*Jaysh*), which moves together at normal step costs. - Landing on an opponent piece/stack captures and removes all opponent pieces on that cell. R5. **Victory:** First player to capture all opponent pieces on the board wins the match. R6. [gap-fill] Turn limits & stacking cap:** A single stack may contain up to 4 pieces maximum. 100 turns maximum per player before draw. ## Edge cases - **Tie at the end condition:** Highest remaining piece count after 100 turns [gap-fill]. - **A player with no legal move:** If rolled values cannot be applied to any piece, roll is forfeited. - **Repetition / cycles:** Serpentine path ends at the final cell of the enemy outer row, where pieces loop or hold [gap-fill]. - **Simultaneous claims:** Not applicable — strictly turn-based. - **Player elimination mid-round:** Not applicable. - **Resource exhaustion:** C pieces per side, permanently removed on capture. - **Termination guarantee:** Guaranteed by capture monotonicity and 100-turn limit. ## State representation - **Persistent state:** `board: Array[4][16] \in List[Piece]`, `active_turn: PlayerID`. - **Ephemeral state:** `roll_queue: List[int]`, `pieces_activated: Dict[PieceID, bool]`. - **Observable information:** Fully observable state. ## Action space - `cast_sticks()`: Generates roll sequence. - `activate_piece(piece_id)`: Applies *Tab* (1). - `advance_piece(piece_id, step)`: Moves piece/stack along path. ## Playability notes - **Single-player-vs-AI:** High suitability for Expectimax AI engines. - **Group games (n>4):** Naturally played as 2 teams with alternating advisors. - **Physical-skill games:** Not applicable (pure board game). - **What is lost:** Sound of clattering palm sticks, sand hole digging, and desert storytelling. ## Implementation hints 1D coordinate path mapping from 0 to 63 along the serpentine route.

Download as JSON

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

Download JSON
Cite this page

Tab (Palestine). (n.d.). Games of Countries. https://gamesofcountries.com/games/ps-palestine/tab

@misc{gamesofcountries-ps-palestine-tab,
  title = {Tab (Palestine)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/ps-palestine/tab}
}