Skip to main content
Formal Specification

Amazigh alignment and capture game — Formal Specification

Morocco · board-abstract · Confidence: medium

← Back to game page

Implementation Suitability

Suitability: engine-readyFidelity: directGap-fills: 1
# Tiddas — AI-optimized specification ## General idea A 2-player Moroccan Amazigh abstract strategy game on a 5x5 Alquerque board (25 intersection nodes connected by orthogonal and diagonal lines). The game proceeds in two distinct phases: an initial piece-drop phase filling 24 of the 25 intersections, followed by an alternating slide-and-leap movement phase to capture all opponent stones. ## Formal model - **Abstraction taken:** Direct representation of a 25-node planar graph G=(V,E), where V={(r,c)|r,c∈{0,1,2,3,4}}. Edges E connect orthogonal neighbors, and diagonal lines connect nodes where (r+c) is even. - **Player/agent count:** 2 agents (P0,P1). - **Turn model:** Alternating sequential turns. ## Formal rules R1. **Graph Topology & Setup:** - 25 nodes (r,c)∈[0,4]×[0,4]. - Connectivity: Orthogonal edges between all (r,c) and (r±1,c) or (r,c±1). Diagonal edges exist only if (r+c)(mod2)==0. - Board starts completely vacant. R2. **Phase 1: Piece Drop (*Placement*):** - Each player possesses 12 pieces in hand. - Players alternate placing 1 piece onto any unoccupied node. - Total drop turns: 24. - At end of Phase 1, exactly 1 node remains unoccupied (traditionally center node (2,2)). R3. **Phase 2: Movement & Capture:** - **Step Move:** Move a friendly piece along any connected edge to an adjacent empty node. - **Jump Capture:** Leap over an adjacent enemy piece along a straight connected line to an immediately empty node directly beyond. The jumped piece is removed. - **Multi-Jump:** If the landing node affords another leap, the piece must continue leaping in the same turn. R4. **Mandatory Capture:** - If an agent has legal jump captures available, non-capturing step moves are illegal. R5. **Win / Loss / Draw Conditions:** - An agent wins when all 12 opposing pieces are captured. - An agent wins when the opponent has pieces but 0 legal moves on their turn. - [gap-fill] A draw occurs if 30 consecutive moves occur without a capture, or if the exact position repeats three times. ## Edge cases - **Tie at the end condition:** Handled by R5 (30-move non-capture rule or threefold repetition 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 30-move non-capture rule. - **Simultaneous claims on the same resource or position:** Turns are strictly sequential; destination node must be vacant. - **Player elimination mid-round; turn order repair:** Not applicable in 2-player game. - **Resource exhaustion:** Finite graph of 25 nodes and 24 pieces total. - **Termination guarantee:** Guaranteed by monotonic piece reduction and the 30-move non-capture limit. ## State representation - **Persistent state:** Board node mapping V→{empty,P0,P1}, game phase ∈{drop,move,ended}, unplaced piece count (U0,U1), non-capture half-move clock, active player ∈{0,1}. - **Observable information:** Perfect information — fully observable board state. ## Action space - `place_piece(r, c)`: Valid during Phase 1 for empty node (r,c). - `step_move(from_r, from_c, to_r, to_c)`: Valid in Phase 2 if (r1,c1) and (r2,c2) are connected and no captures exist. - `jump_move(from_r, from_c, path)`: Ordered sequence of landing nodes for multi-jump captures. ## Playability notes - **Single-player-vs-AI:** Ideal: Minimax with Alpha-Beta pruning or MCTS plays flawlessly. - **Group games (N>4):** Not applicable (pure 2-player abstract). - **Physical-skill games:** Not applicable (pure discrete combinatorial game). - **What is lost in the adaptation:** The rustic charm of sitting on stone benches in the High Atlas carving lines with flint. ## Implementation hints - Precompute adjacency lists and jump target maps for all 25 nodes to allow O(1) move generation. - First milestone: Implement Phase 1 drop logic and basic orthogonal/diagonal step moves on the 25-node graph.

Download as JSON

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

Download JSON
Cite this page

Tiddas (Morocco). (n.d.). Games of Countries. https://gamesofcountries.com/games/ma-morocco/tiddas

@misc{gamesofcountries-ma-morocco-tiddas,
  title = {Tiddas (Morocco)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/ma-morocco/tiddas}
}