Skip to main content
Formal Specification

Sixteen Soldiers (Mughal-Pathan) — Formal Specification

Bangladesh · board-abstract · Confidence: high

← Back to game page

Implementation Suitability

Suitability: engine-readyFidelity: directGap-fills: 3
# Sholo Guti — AI-optimized specification ## General idea A deterministic two-player abstract strategy board game played on an expanded Alquerque-family grid of 37 line intersections (a central 5×5 grid flanked by two 3-row triangular wings). Each player commands an army of 16 soldiers (*guti*), maneuvering along marked orthogonal and diagonal lines to execute single or multi-jump leaping captures. The objective is to eradicate all 16 enemy soldiers or completely immobilize the opposing army. ## Formal model - **Abstraction taken:** Direct graph formalization. The board is represented as an undirected graph G=(V,E) with |V|=37 vertices (25 in the central 5×5 square + 6 in the North triangular wing + 6 in the South triangular wing) connected by 84 undirected edges along orthogonal, diagonal, and triangular ray lines. - **Player/agent count:** 2 players (Player 1 / White, 16 pieces; Player 2 / Black, 16 pieces). - **Turn model:** Strictly alternating sequential turns. Player 1 moves first. ## Formal rules R1. Setup: - The 37 vertices are indexed 0..36. - Player 1 pieces occupy the 16 northernmost vertices (North wing + first two horizontal rows of central grid). - Player 2 pieces occupy the 16 southernmost vertices (South wing + last two horizontal rows of central grid). - The 5 central horizontal equator vertices are initially unoccupied. R2. On their turn, an agent must make exactly one legal move (either a standard step or a jumping capture sequence). Passing is strictly illegal. R3. Standard Step: A piece at vertex u may move along an edge (u,v)∈E to an adjacent vertex v if and only if v is unoccupied. R4. Jumping Capture: A piece at vertex u may jump over an adjacent enemy piece at vertex v to land on an empty vertex w if and only if: - (u,v)∈E and (v,w)∈E, - u,v,w form a strictly collinear straight line along the marked board grid, - Vertex w is unoccupied. The jumped enemy piece at vertex v is permanently removed from the board. R5. [gap-fill] Multi-Jump Continuation: After completing a jumping capture landing on vertex w, if the same piece has one or more additional valid jumping captures available from w, the player may optionally continue jumping in the same turn, removing all jumped enemy pieces. The turn ends when the player chooses to stop or when no further jumps are possible. R6. Win / Loss Conditions: - Total Annihilation: A player wins immediately if they capture all 16 opposing pieces. - Stalemate Victory: A player wins immediately if at the start of the opponent's turn, the opponent has ≥1 piece remaining but 0 legal moves (no legal steps and no legal captures). R7. [gap-fill] Repetition Draw: If the exact same global board configuration (all piece positions and active player) repeats 3 times, the game is declared an immediate Draw. R8. [gap-fill] 50-Move Draw Rule: If 50 consecutive full moves (100 plies) occur without a single capture, the game terminates in a Draw. ## Edge cases - Tie at the end condition: Achievable only via R7 (threefold repetition) or R8 (50-move captureless limit); mutual win states are impossible. - A player with no legal move: Stalemate is an immediate loss for the immobilized player (R6); stalemate is not a draw. - Repetition / cycles: Bounded by R7 (threefold repetition) and R8 (50-move limit). - Simultaneous claims on the same resource or position: Turns are strictly sequential; each vertex holds at most one piece. - Player elimination mid-round; turn order repair: Not applicable; strictly a 2-player duel. - Resource exhaustion (pieces, tokens, space, time): Tracked explicitly by active piece counts per player ([0..16]); dropping to 0 triggers instant loss. - Termination guarantee: Captures strictly reduce piece counts (monotonic state progression). In non-capture cycles, R7 and R8 provably guarantee finite game termination. ## State representation - Persistent state: - `board`: Array of length 37 where each vertex ∈{EMPTY,PLAYER_1,PLAYER_2}. - `piece_counts`: Array of 2 integers (remaining pieces for Player 1 and Player 2, range [0..16]). - `active_player`: ∈{PLAYER_1,PLAYER_2}. - `halfmove_clock`: Integer counter of plies since last capture for R8. - `position_hashes`: Set/hash table of previous board states for R7. - Per-turn ephemeral state: Multi-jump path [v0,v1,v2,...] and list of captured vertices. - Observable information: Fully observable game state (no hidden information, zero stochasticity). ## Action space - `step(from_v, to_v)`: Move a piece to an adjacent empty vertex. Precondition: `board[from_v] == active_player`, `(from_v, to_v) in E`, `board[to_v] == EMPTY`. - `jump_capture(path=[v_0, v_1, ...])`: Execute a single or chained leaping capture along collinear straight lines. Precondition: each leg jumps over an enemy piece into a vacant node. ## Playability notes - Single-player-vs-AI: Ideal candidate for alpha-beta minimax, negamax with bitboards, or AlphaZero-style MCTS neural network training. - Group games (n>4): Strictly a 2-player zero-sum adversarial game. - Physical-skill games: Pure combinatorial abstract board game; zero physical skill component. - What is lost in the adaptation: None; the graph formalization captures the exact traditional 37-intersection board layout and folk rules. ## Implementation hints Low complexity. The 37-vertex board fits comfortably into a 64-bit integer bitboard (`uint64_t` for Player 1, Player 2, and Empty masks). Branching factor: average 10–25 legal moves per turn. Milestone 1: implement 37-node adjacency and collinear line lookup tables; Milestone 2: build an alpha-beta minimax engine with piece-count and board-mobility evaluation heuristics.

Download as JSON

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

Download JSON
Cite this page

Sholo Guti (Bangladesh). (n.d.). Games of Countries. https://gamesofcountries.com/games/bd-bangladesh/sholo-guti

@misc{gamesofcountries-bd-bangladesh-sholo-guti,
  title = {Sholo Guti (Bangladesh)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/bd-bangladesh/sholo-guti}
}