Skip to main content
Formal Specification

Javanese Draughts / Damdas — Formal Specification

Indonesia · board-abstract · Confidence: medium

← Back to game page

Implementation Suitability

Suitability: engine-readyFidelity: directGap-fills: 3
# Dam-daman — AI-optimized specification ## General idea A two-player discrete combinatorial board game played on a 33-node undirected planar graph (a 5x5 grid with full diagonals and two attached triangular mountains). Agents move 16 pieces along connected edges, performing single and multi-leap captures, with mandatory capture enforcement ("DAM" penalty) and King promotions at the opponent's apex. ## Formal model - **Abstraction taken:** Board is formalized as an undirected graph G=(V,E) with |V|=33 vertices and defined edge adjacencies. - **Player/agent count:** 2 agents (Player 0 = White/Stones, Player 1 = Black/Tiles). - **Turn model:** Strictly sequential, alternating turns. ## Formal rules R1. Graph topology: Vertices V={0..32}. - Central grid: 25 vertices organized in a 5x5 array (rows 0..4, cols 0..4). - Mountain 0 (Player 0 home): 4 vertices connected to row 0. - Mountain 1 (Player 1 home): 4 vertices connected to row 4. - Edges E connect orthogonal, diagonal, and mountain lines. R2. Initial state: Player 0 occupies Mountain 0 and rows 0–1 (16 pieces). Player 1 occupies Mountain 1 and rows 3–4 (16 pieces). Row 2 (central line) contains only empty nodes, except shared nodes. R3. Legal moves: - Normal step: Move 1 piece along edge e=(u,v) to vacant node v. (Non-king pieces cannot step toward their own home apex [gap-fill]). - Leap capture: If u is active piece, w is adjacent enemy piece, and node v lies in a straight colinear continuation beyond w and is vacant, the piece leaps u→v; enemy piece at w is removed. Multi-leaps are executed in the same turn if available. R4. Mandatory capture ("DAM" rule): - If at turn start any legal capture jump exists on the board, the active player *must* execute a capture move. - [gap-fill] In computational spec: The action generator strictly restricts the legal action set to capture moves if any capture is available (huffing penalty is automated by pruning illegal non-capture moves). R5. King promotion: A piece reaching the opponent's mountain apex node (node 0 for Player 1, node 32 for Player 0) is promoted to `King`. A King can slide arbitrary distance along unobstructed straight lines and execute flying leap captures. R6. Win condition: An agent wins when the opponent has 0 pieces remaining or has 0 legal moves on their turn (stalemate loss for immobilized player). ## Edge cases - Tie at the end condition: Standard three-fold board repetition rule triggers an immediate draw. - A player with no legal move: Immobilized player loses immediately per R6. - Repetition / cycles: Governed by the three-fold repetition rule [gap-fill] and a 100-ply move limit without capture. - Simultaneous claims on the same resource or position: Not applicable (strictly turn-based). - Player elimination mid-round: Captured pieces are removed instantaneously upon jump resolution. - Resource exhaustion: Piece counts strictly decrease monotonically down to terminal states. - Termination guarantee: Captures reduce total piece count (N≤32→0); three-fold repetition and 100-ply non-capture counters provably guarantee finite game termination. ## State representation - Persistent state: - `board`: array of 33 integers ∈{−2,−1,0,1,2} (0=empty,1=P0 piece,2=P0 King,−1=P1 piece,−2=P1 King). - `active_player`: 0 or 1. - `halfmove_clock`: integer (moves since last capture). - `position_history`: hash table of visited board state strings. - Observable information: Fully observable (perfect information). ## Action space - `move(from_node, to_node)`: Simple step. - `jump(from_node, jumped_nodes_sequence, to_node)`: Single or multi-hop capture path. ## Playability notes - Single-player-vs-AI: Engine-ready; standard minimax / Alpha-Beta with piece-square tables and piece-count evaluation functions plays at master level. - Group games (n>4): Not applicable (2-player duel). - Physical-skill games: Not applicable (100% discrete strategic abstract). - What is lost in the adaptation: The social verbal drama of calling out *"DAM!"* and physically snatching the opponent's piece is replaced by automated legal-action masking. ## Implementation hints Graph adjacency table for the 33 nodes with precomputed collinear 3-node rays simplifies leap validation. Branching factor is typically 10..25 moves per ply. First milestone: Construct the 33-node adjacency graph and validate move generator against initial board state.

Download as JSON

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

Download JSON
Cite this page

Javanese Draughts / Damdas (Indonesia). (n.d.). Games of Countries. https://gamesofcountries.com/games/id-indonesia/dam-daman

@misc{gamesofcountries-id-indonesia-dam-daman,
  title = {Javanese Draughts / Damdas (Indonesia)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/id-indonesia/dam-daman}
}