Formal Specification
Mauritanian desert draughts (Srand / Zamma) — Formal Specification
Mauritania · board-abstract · Confidence: medium
← Back to game pageImplementation Suitability
Suitability: engine-readyFidelity: directGap-fills: 2
# Dhamet — AI-optimized specification
## General idea
A complex 2-player desert abstract strategy board game played on a 9x9 grid of 81 connected intersections with 40 pieces per player. Distinguishing mechanics include forward-only steps for ordinary men, multi-directional jumping captures, maximal capture priority, the *Soufla* penalty for missed captures, flying *Sultan* promotions, and loss-by-immobilization.
## Formal model
- **Abstraction taken:** Direct representation on an 81-node planar graph , where . Edges connect orthogonal adjacent nodes, and diagonal lines connect adjacent nodes where is even.
- **Player/agent count:** 2 agents ().
- **Turn model:** Alternating sequential turns.
## Formal rules
R1. **Graph Topology & Initial Setup:**
- 81 nodes .
- Edges: Orthogonal connections between and or . Diagonal connections exist if .
- Piece placement:
- pieces: All nodes in rows , plus row 4 nodes (40 pieces).
- pieces: All nodes in rows , plus row 4 nodes (40 pieces).
- Node is initially empty.
R2. **Piece Types & Movement:**
- **Ordinary Man (*Baidhaq*):**
- Non-capturing step: Move 1 step along connected line forward (row delta for , for ) or diagonally forward.
- Jumping capture: Leap over an adjacent opposing piece in any connected direction (forward, backward, sideways, diagonal) to an immediately vacant node beyond.
- **Sultan (*Soltan*):**
- Promoted when an ordinary man reaches the opponent's back rank ( for , for ).
- Non-capturing move: Any number of vacant nodes along an unobstructed straight line in all 8 directions.
- Jumping capture: Leap over an enemy piece located at any distance along an unobstructed line, landing on any vacant node beyond it.
R3. **Capture Mandate & Maximal Priority:**
- If an agent has legal jump captures available, non-capturing step moves are illegal.
- If multiple capture sequences are possible, the agent **must** execute a sequence that captures the maximal count of opponent pieces.
R4. **Automated Soufla Enforcement:**
- [gap-fill] In automated game engines, illegal non-maximal moves are filtered from the legal action set; in simulation against fallible human agents, failing to take a maximal capture triggers immediate removal of the offending piece from the board.
R5. **Win / Loss / Draw Conditions:**
- An agent wins when all 40 opposing pieces are captured.
- An agent wins when the opponent has pieces remaining but 0 legal moves on their turn (stalemate = loss for immobilized player).
- [gap-fill] A draw occurs upon threefold repetition of the exact board position or 50 consecutive moves without a capture or promotion.
## Edge cases
- **Tie at the end condition:** Handled by R5 (threefold repetition or 50-move non-capture rule triggers a draw).
- **A player with no legal move:** Handled strictly by R5: immobilization is a loss for the immobilized player.
- **Repetition / cycles:** Bounded by the 50-move non-capture rule.
- **Simultaneous claims on the same resource or position:** Turns are strictly sequential; destination node must be empty.
- **Player elimination mid-round; turn order repair:** Not applicable — 2-player zero-sum game.
- **Resource exhaustion:** Finite graph of 81 nodes and 80 pieces total.
- **Termination guarantee:** Guaranteed by monotonic piece reduction and the 50-move cycle breaker.
## State representation
- **Persistent state:** Board node mapping , active agent , non-capture half-move clock, position history hash table.
- **Observable information:** Perfect information — fully observable board state.
## Action space
- `step_move(from_r, from_c, to_r, to_c)`: Simple forward step.
- `jump_move(from_r, from_c, path)`: Ordered list of landing node coordinates executing a maximal multi-jump capture.
## Playability notes
- **Single-player-vs-AI:** Ideal: Alpha-Beta Minimax with bitboards or MCTS plays at grandmaster level on the 81-node graph.
- **Group games ():** Not applicable (pure 2-player combinatorial abstract).
- **Physical-skill games:** Not applicable (pure discrete strategy).
- **What is lost in the adaptation:** The physical tactile feel of dried camel dung pellets and twigs in desert sand and the communal murmurs of elder spectators.
## Implementation hints
- Represent the 81 nodes with three 64-bit bitboards per player (or two 128-bit integers) for high-speed move generation and jump raycasting.
- First milestone: Implement 81-node graph connectivity and verify initial 40v40 setup with central empty node .
Download as JSON
Download the full game corpus entry for this game as structured JSON.
Download JSONCite this page
Mauritanian desert draughts (Srand / Zamma) (Mauritania). (n.d.). Games of Countries. https://gamesofcountries.com/games/mr-mauritania/dhamet
@misc{gamesofcountries-mr-mauritania-dhamet,
title = {Mauritanian desert draughts (Srand / Zamma) (Mauritania)},
year = {n.d.},
publisher = {Games of Countries},
url = {https://gamesofcountries.com/games/mr-mauritania/dhamet}
}