Formal Specification
Sudanese Seega — Formal Specification
Sudan · board-abstract · Confidence: medium
← Back to game pageImplementation Suitability
Suitability: engine-readyFidelity: directGap-fills: 2
# Al-Seega al-Sudaniya / Kharbga — AI-optimized specification
## General idea
A deterministic abstract board game played on a 5x5 orthogonal grid. Agents complete a drop phase to occupy all non-center cells, then move orthogonally to capture opposing pieces via custodian sandwich formations, chaining consecutive captures on successful attacks.
## Formal model
- **Abstraction taken:** None; standard discrete grid board game mechanics.
- **Player/agent count:** 2 agents (Player 1 and Player 2).
- **Turn model:** Sequential alternating turns during placement; alternating turns during movement with conditional bonus moves on capture.
## Formal rules
R1. The board is a 5x5 2D grid indexed `(r, c)` where `r, c ∈ {0..4}`. Center cell is `(2, 2)`.
R2. **Placement Phase:**
- Player 1 and Player 2 alternate placing 2 pieces per turn onto any empty cell `(r, c) ≠ (2, 2)`.
- Exactly 12 turns (6 turns each) occur until 24 pieces are placed; cell `(2, 2)` remains empty.
R3. **Movement Phase:**
- Player 1 moves first. An active agent moves a friendly piece from `(r1, c1)` to an adjacent orthogonal empty cell `(r2, c2)` (`|r1 - r2| + |c1 - c2| == 1`).
R4. **Custodian Capture:**
- If moving to `(r2, c2)` results in an opponent piece at `(ro, co)` being orthogonally between `(r2, c2)` and another friendly piece at `(rf, cf)` along the same row or column, the opponent piece at `(ro, co)` is captured and removed, provided `(ro, co) ≠ (2, 2)`.
- Central cell `(2, 2)` is safe: pieces on `(2, 2)` cannot be captured.
- Suicide moves are safe: A piece moving between two opponent pieces is not captured.
R5. **Bonus Capture Chain:**
- If a move results in capture, the active agent retains the turn and may move the same piece again to execute another capture, repeating until no capture is possible or the agent passes.
R6. [gap-fill] **Stalemate Opening:** If an agent has pieces remaining but no legal move exists (completely blocked), the opponent must make a move that opens a passage; if no such opening move is possible, the agent with more surviving pieces wins.
R7. [gap-fill] **Repetition Limit:** If the exact same board state occurs 3 times with the same player to move, the game is declared a draw.
R8. Win condition: An agent wins when the opponent has piece remaining, or is completely eliminated.
## Edge cases
- Tie at the end condition: Achieved via R7 threefold repetition rule or mutual agreement when both players have pieces without captures.
- A player with no legal move: Handled by R6; opponent must open a path or game terminates by piece count comparison.
- Repetition / cycles: Explicitly loop-broken by R7 (threefold repetition rule).
- Simultaneous claims on the same resource or position: Not applicable; turns are strictly sequential.
- Player elimination mid-round; turn order repair: When an agent's pieces fall to , game ends immediately.
- Resource exhaustion (pieces, tokens, space, time): Pieces strictly decrease during play; board size is invariant.
- Termination guarantee: Guaranteed by the finite piece count and R7 repetition limiter.
## State representation
- Persistent state:
- `board`: 5x5 array of `EMPTY | PLAYER_1 | PLAYER_2`.
- `phase`: `PLACEMENT | MOVEMENT | FINISHED`.
- `current_player`: `PLAYER_1 | PLAYER_2`.
- `pieces_remaining`: `{PLAYER_1: int, PLAYER_2: int}`.
- `history_hash_counts`: map of board state hashes to occurrence counts.
- Ephemeral state: `active_chain_piece`: coordinates of piece in multi-capture chain (or null).
- Observable information: Fully observable by both agents.
## Action space
- Placement: `place(r1, c1, r2, c2)` — coordinates of two empty non-center cells.
- Movement: `move(r_from, c_from, r_to, c_to)` — orthogonal move to empty neighbor.
- Pass: `pass_chain()` — end a capture chain when no further mandatory capture is desired.
## Playability notes
- Single-player-vs-AI: Engine-ready; standard minimax/alpha-beta or MCTS works natively.
- Group games (n>4): Not applicable; strictly 2-player game.
- Physical-skill games: Direct translation; no skill parameterization required.
- What is lost in adaptation: None; pure discrete strategy is preserved 100%.
## Implementation hints
Very high strategic depth with zero hidden information. Branching factor is ~10–15 during placement and ~4–8 during movement. First milestone: implement board array, placement phase, and orthogonal custodian capture resolver with R4 suicide-safety logic.
Download as JSON
Download the full game corpus entry for this game as structured JSON.
Download JSONCite this page
Seega Sudaniya (Sudan). (n.d.). Games of Countries. https://gamesofcountries.com/games/sd-sudan/seega-sudaniya
@misc{gamesofcountries-sd-sudan-seega-sudaniya,
title = {Seega Sudaniya (Sudan)},
year = {n.d.},
publisher = {Games of Countries},
url = {https://gamesofcountries.com/games/sd-sudan/seega-sudaniya}
}