Skip to main content
Formal Specification

Sudanese Tab (Palm Stave Board Race) — Formal Specification

Sudan · board-race · Confidence: medium

← Back to game page

Implementation Suitability

Suitability: engine-readyFidelity: directGap-fills: 2
# Al-Tab al-Sudani — AI-optimized specification ## General idea A turn-based stochastic race and capture game played on a 4-row grid. Agents cast 4 binary palm-wood slats to generate movement values, unlock dormant pieces via rolls of Tab (1), and advance pieces along a serpentine track to capture opponent pieces on direct landing. ## Formal model - **Abstraction taken:** Stave tosses are modeled as the exact binomial distribution of 4 independent Bernoulli trials: - 1 White = Tab (value 1, bonus roll, P = 4/16 = 0.25) - 2 White = 2 (value 2, no bonus, P = 6/16 = 0.375) - 3 White = 3 (value 3, no bonus, P = 4/16 = 0.25) - 4 White = 4 (value 4, bonus roll, P = 1/16 = 0.0625) - 0 White = 6 (value 6, bonus roll, P = 1/16 = 0.0625) - **Player/agent count:** 2 agents (Player 0 and Player 1). - **Turn model:** Sequential turns; active agent accumulates roll values, then allocates them to pieces. ## Formal rules R1. Board is 4 rows ×C columns (default C=9). Cells indexed `(row, col)` where `row ∈ {0..3}`, `col ∈ {0..C-1}`. R2. Player 0 starts with C pieces in row 0; Player 1 starts with C pieces in row 3. All pieces start `DORMANT`. R3. Turn Stave Casting: Active agent rolls staves until a non-bonus roll occurs, collecting roll integers into `turn_rolls`. R4. Unlocking: An available roll of value 1 (`Tab`) must be expended to convert a piece from `DORMANT` to `ACTIVE`, advancing it 1 step along the track. R5. Serpentine Track Progression: - Track 0 (Player 0): Row 0 (col 0 to C-1) → Row 1 (col C-1 to 0) → Row 2 (col 0 to C-1) → Row 3 (col C-1 to 0). - Track 1 (Player 1): Row 3 (col 0 to C-1) → Row 2 (col C-1 to 0) → Row 1 (col 0 to C-1) → Row 0 (col C-1 to 0). R6. Captures: Landing by exact count on a cell occupied by opponent piece(s) permanently captures and removes all opponent piece(s) from that cell. R7. Stacking: Multiple friendly pieces occupying the same cell form a stack that advances as a single unit when landed upon. R8. [gap-fill] Mandatory Move Execution: An agent must use all rolled values if legal moves exist; if no legal move exists for a value, that value is discarded. R9. [gap-fill] Non-Capture Limit / Repetition: If 50 consecutive turns elapse without any capture, the player with the most surviving pieces wins. R10. Win condition: An agent wins when all opponent pieces are eliminated. ## Edge cases - Tie at the end condition: Resolved via R9 if turn limit is reached; otherwise strictly impossible since win is by total elimination. - A player with no legal move: Unused roll values are forfeited; turn passes to opponent. - Repetition / cycles: Bounded by R9 (50 turns without capture triggers piece-count evaluation). - Simultaneous claims on the same resource or position: Turns are sequential; landing on an opponent cell resolves as a capture immediately. - Player elimination mid-round; turn order repair: Game ends immediately upon elimination of an agent's last piece. - Resource exhaustion (pieces, tokens, space, time): Pieces strictly decrease through capture; board dimensions are constant. - Termination guarantee: Guaranteed by the absorbing nature of captures and the 50-turn non-capture limit (R9). ## State representation - Persistent state: - `board_positions`: map of `piece_id` to `{row, col, status, player}`. - `surviving_pieces`: `{PLAYER_0: int, PLAYER_1: int}`. - `turns_since_last_capture`: integer counter. - Per-turn ephemeral state: `turn_rolls`: list of integers `[v_1, v_2, ...]`. - Observable information: Fully observable by all agents. ## Action space - `unlock(piece_id)`: expend a roll of 1 to activate dormant piece. - `move_piece(piece_id, roll_value)`: advance piece by specified roll value. ## Playability notes - Single-player-vs-AI: Engine-ready; standard Expectiminimax or MCTS with chance nodes operates natively. - Group games (n>4): Cleanly reduces to 2-agent partnership form (2 vs 2 sharing pieces on one side). - Physical-skill games: Direct stave-toss probability distribution requires no motor modeling. - What is lost in adaptation: The social rhyming chants associated with each stave roll are omitted. ## Implementation hints Discrete and structured. The primary implementation task is mapping the serpentine 1D track onto the 4xN 2D board coordinates. First milestone: implement 4-stave binomial roll generator and track indexing before implementing stack merging.

Download as JSON

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

Download JSON
Cite this page

Sudanese Tab (Palm Stave Board Race) (Sudan). (n.d.). Games of Countries. https://gamesofcountries.com/games/sd-sudan/al-tab-al-sudani

@misc{gamesofcountries-sd-sudan-al-tab-al-sudani,
  title = {Sudanese Tab (Palm Stave Board Race) (Sudan)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/sd-sudan/al-tab-al-sudani}
}