Formal Specification
Levant Mancala — Formal Specification
Lebanon · board-abstract · Confidence: low
← Back to game pageImplementation Suitability
Suitability: engine-readyFidelity: directGap-fills: 2
# Al-Manqalah — AI-optimized specification
## General idea
The traditional Lebanese/Levantine 14-hole Mancala game. Played on a board with 2 rows of 7 holes, initialized with 7 pebbles per hole (98 total pebbles). Players sow pebbles counter-clockwise. If the last pebble lands in a hole making its total count exactly 2 or 4, all pebbles in that hole (and any continuous preceding holes holding 2 or 4) are captured.
## Formal model
- **Board structure:** 14 holes indexed in counter-clockwise order. Holes belong to Player A; Holes belong to Player B.
- **Player/agent count:** 2 players.
- **Turn model:** Alternating turns. Player A chooses an index where ; Player B chooses an index where .
## Formal rules
R1. **Initial setup:** for all . Total pebbles = 98. Scores = 0.
R2. **Sowing action:**
- Player scoops all pebbles from chosen hole . .
- Pebbles are distributed 1 by 1 into consecutive holes: . The starting hole is skipped if a full lap occurs.
R3. **Capture condition:**
- Let be the final landing hole.
- If :
- Player captures pebbles. Score increases; .
- **Continuous backward check:** For preceding holes : if , capture those pebbles as well; stop upon reaching the first hole where .
R4. **Starvation / Game end:**
- If the active player has 0 pebbles on their side of the board at the start of their turn, the game ends immediately.
- All remaining pebbles on the board are awarded to the other player [gap-fill].
R5. **Victory:** Player with captured pebbles wins. If both score 49, match is a draw.
R6. [gap-fill] Turn limit:** Maximum 200 turns before game evaluation.
## Edge cases
- **Tie at the end condition:** Exactly 49-49 pebble count results in a draw.
- **A player with no legal move:** Triggers starvation rule R4.
- **Repetition / cycles:** Sowing and captures strictly reduce active board pebble count.
- **Simultaneous claims:** Not applicable — turn-based.
- **Player elimination mid-round:** Not applicable.
- **Resource exhaustion:** Monotonically decreasing board pebbles.
- **Termination guarantee:** Provable termination via pebble capture monotonicity.
## State representation
- **Persistent state:** `scores: Dict[PlayerID, int]`.
- **Ephemeral state:** `board: Array[14] of int`, `active_player: PlayerID`.
- **Observable information:** Fully observable board state.
## Action space
- `sow_hole(hole_index)`: Selects own non-empty hole.
## Playability notes
- **Single-player-vs-AI:** Excellent for Minimax / Alpha-Beta pruning engines.
- **Group games (n>4):** Strictly 2-player.
- **Physical-skill games:** Not applicable (pure strategy).
- **What is lost:** Clatter of polished stone river pebbles on carved cedar wood boards and village tea sipping.
## Implementation hints
1D array of 14 integers with modulo index arithmetic.
Download as JSON
Download the full game corpus entry for this game as structured JSON.
Download JSONCite this page
Levant Mancala (Lebanon). (n.d.). Games of Countries. https://gamesofcountries.com/games/lb-lebanon/manqalah
@misc{gamesofcountries-lb-lebanon-manqalah,
title = {Levant Mancala (Lebanon)},
year = {n.d.},
publisher = {Games of Countries},
url = {https://gamesofcountries.com/games/lb-lebanon/manqalah}
}