Skip to main content
Formal Specification

Duzzum (The Alignment Game) — Formal Specification

Turkmenistan · board-abstract · Confidence: low

← Back to game page

Implementation Suitability

Suitability: engine-readyFidelity: directGap-fills: 3
# Düzzüm — AI-optimized specification ## General idea An ancient two-player abstract strategy alignment game played on a topological graph of three concentric nested squares with orthogonal midpoint connections (24 vertices). Players place and slide pieces along grid lines to form orthogonal trios (*düzzüm*), capturing opposing pieces until an opponent is reduced below 3 pieces or completely immobilized. ## Formal model - **Abstraction taken:** Direct formalization — the traditional rules constitute a complete discrete mathematical system. Board topology is modeled as an undirected graph G=(V,E) with |V|=24 vertices and |E|=32 edges. - **Player/agent count:** 2 players (White and Black). - **Turn model:** Strictly sequential, alternating turns (Player 1 → Player 2 → Player 1). ## Formal rules R1. **Graph Topology & Starting Pieces:** - Vertices V={1,2,…,24} represent the 8 vertices of the outer, middle, and inner squares. - Edges E connect adjacent corners/midpoints of each square, and 4 orthogonal lines connect the midpoints of concentric squares. - In standard *Dokuz daşly düzzüm*, each player starts with P0=9 pieces in hand (or P0=8 in *Sekiz daşly düzzüm*). Board starts empty. R2. **Phase 1 (Drop / Placement Phase):** - Players alternate placing one piece from hand onto any vacant vertex v∈V. - If a placement creates a new alignment of 3 contiguous friendly pieces along any line segment of G (a *düzzüm*), the player immediately captures and removes 1 opponent piece from the board. - An opponent piece that is part of an active mill cannot be captured unless all opponent pieces on the board are in mills. - Phase 1 ends when both players have placed all P0 pieces. R3. **Phase 2 (Movement Phase):** - Players alternate moving one of their pieces from its current vertex u to an adjacent vacant vertex v, where (u,v)∈E. - If the move forms a new *düzzüm*, the player captures 1 opponent piece per R2 rules. - Opening and closing a mill on consecutive turns is legal and triggers a capture each time the mill is completed. R4. **Phase 3 (Flying Phase — *Uçmak*):** - [gap-fill] When a player has exactly 3 pieces remaining on the board, that player may move any of their pieces to ANY vacant vertex on the entire graph, ignoring adjacency constraints. R5. **End Condition & Victory:** - A player loses immediately if: - Their remaining pieces on the board are reduced to 2 (cannot form a mill), or - It is their turn and they have no legal moves (completely blocked / *gabamak*). - [gap-fill] Draw condition: The game is drawn if: (a) Threefold repetition of the exact identical board state occurs with the same player to move, or (b) 50 consecutive moves occur without a piece capture. ## Edge cases - Tie at the end condition: Handled by R5 — threefold repetition or 50 moves without capture results in an immediate formal draw (*deňme-deň*). - A player with no legal move: Handled by R5 — if an active player has no legal moves during Phase 2, that player loses immediately by stalemate (*gabamak*). - Repetition / cycles: Folk play permits infinite cycling; [gap-fill] bounded by R5's threefold repetition and 50-move non-capture draw rules. - Simultaneous claims on the same resource or position: Not applicable — turns are strictly sequential and vertices hold at most 1 piece. - Player elimination mid-round; turn order repair: Not applicable — exactly 2 players; game ends when one player is reduced to 2 pieces or immobilized. - Resource exhaustion (pieces, tokens, space, time): Exactly 2P0 pieces exist total; piece captures strictly reduce board population. - Termination guarantee: why the game provably ends: Guaranteed by R5's 50-move non-capture rule and threefold repetition checks on a finite graph state space. ## State representation - Persistent state: Graph G=(V,E), starting piece count P0∈{8,9,12}. - Per-player state: `pieces_in_hand: int [0, P0]`, `pieces_on_board: int [0, P0]`, `is_flying: bool`. - Per-turn ephemeral state: Active player, board occupancy array `occupancy: Array[24] in {EMPTY, WHITE, BLACK}`, move history list, non-capture counter, state repetition hash table. - Observable information: Fully observable — complete perfect-information game with zero hidden state or stochasticity. ## Action space - `PlacePiece(vertex_id, capture_vertex_id=None)`: Phase 1 placement. Preconditions: `pieces_in_hand > 0`, `vertex_id` is empty; `capture_vertex_id` required if and only if a *düzzüm* is formed. - `MovePiece(from_vertex, to_vertex, capture_vertex_id=None)`: Phase 2/3 movement. Preconditions: `from_vertex` has friendly piece, `to_vertex` is empty; `(from_vertex, to_vertex) in E` unless `pieces_on_board == 3` (flying). ## Playability notes - Single-player-vs-AI: Natural — ideal domain for Minimax / Alpha-Beta pruning, MCTS, or reinforcement learning agents. - Group games (n>4): Not applicable — strictly a 2-player perfect information zero-sum abstract. - Physical-skill games: None — pure strategic alignment and spatial topology. - What is lost in the adaptation: Nothing — the discrete formalization is a 1:1 mathematical representation of the traditional board game. ## Implementation hints Low complexity. Standard board game engine architecture. State can be bitboard-encoded in two 32-bit integers (one for White, one for Black). Branching factor: ~15–20 in Phase 1, ~5–10 in Phase 2, ~30 in Phase 3. Suggested first milestone: implement the graph topology and *düzzüm* detection logic, then build the Phase 1/2 state machine with random playouts before adding Minimax search.

Download as JSON

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

Download JSON
Cite this page

Düzzüm (Turkmenistan). (n.d.). Games of Countries. https://gamesofcountries.com/games/tm-turkmenistan/duzzum

@misc{gamesofcountries-tm-turkmenistan-duzzum,
  title = {Düzzüm (Turkmenistan)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/tm-turkmenistan/duzzum}
}