Formal Specification
Mills / Nine Men's Morris — Formal Specification
Kosovo · board-abstract · Confidence: low
← Back to game pageImplementation Suitability
Suitability: engine-readyFidelity: directGap-fills: 2
# Cic-mic — AI-optimized specification
## General idea
A deterministic, zero-sum two-player abstract strategy alignment game played on a 24-vertex graph of three concentric squares. Across three sequential phases (Placement, Adjacency Movement, and Flying), players aim to form straight 3-in-a-row alignments ("mills") to capture enemy pieces. The game ends in victory when an opponent is reduced to fewer than three pieces or is left with no legal moves.
## Formal model
- **Board Graph:** where vertices and undirected edges connecting concentric ring midpoints and corners.
- **Mills Definition:** Exactly 16 predefined collinear triplets (8 horizontal, 8 vertical).
- **Player counts:** 2 agents ().
- **Turn model:** Strictly alternating sequential turns.
## Formal rules
R1. **Initial State:** Board is empty (). Unplaced piece reserves , . Active pieces on board , . Active player .
R2. **Phase 1 (Placement):** While or :
- Active player selects an empty vertex ().
- , , .
- If placing forms one or more new mills such that , performs a mandatory capture action: remove one piece of opponent from vertex .
- *Mill Protection:* Piece cannot belong to any active opponent mill unless all pieces of on board belong to mills.
- Turn passes to .
R3. **Phase 2 (Movement):** When and , while :
- Active player selects an origin vertex with and a destination vertex with such that .
- , .
- If this move closes a mill, executes a mandatory capture following Rule R2 mill-protection rules.
- Turn passes to .
R4. **Phase 3 (Flying):** When and :
- Active player selects an origin vertex with and any destination vertex with (regardless of edge adjacency ).
- Movement and capture resolve per R3.
R5. **Win Condition:** Player wins immediately if at the start of opponent's turn:
- (opponent has fewer than 3 pieces remaining), or
- has no legal moves (in Phase 2, all pieces of are adjacent only to occupied vertices).
R6. **Draw Conditions:** [gap-fill]
- *Threefold Repetition:* If the exact board state (vertex ownership, active player, unplaced counts) repeats three times with the same player to move, the game is declared a draw.
- *Move Limit:* If 50 consecutive moves occur without any capture, the game is declared a draw.
## Edge cases
- **Tie at the end condition:** Not applicable under standard play; draws only occur via the explicit loop-breaking rules in R6.
- **A player with no legal move:** Handled explicitly by R5: if active player has in Phase 2 but has zero adjacent empty vertices, that player immediately loses the game.
- **Repetition / cycles:** Folk rules are silent on perpetual back-and-forth mill reopening; [gap-fill] standard threefold repetition rule and 50-move no-capture draw counter (R6) prevent infinite cycles.
- **Simultaneous claims on the same resource or position:** Not applicable; turns are strictly sequential and each vertex holds at most one piece.
- **Player elimination mid-round / turn order repair:** Not applicable in a 2-agent game; reducing instantly triggers the match win condition.
- **Resource exhaustion:** Board vertices and piece counts are strictly finite (, ). No piece re-entry occurs after capture.
- **Termination guarantee:** The combination of finite pieces (18 total), monotonic piece reduction on captures, and the loop-breaking counters in R6 provably guarantees that every game tree branch terminates in finite steps.
## State representation
- **Persistent state:**
- `board`: Array of 24 elements .
- `unplaced`: Tuple .
- `piece_count`: Tuple .
- `active_player`: or .
- `phase`: Enum .
- `halfmove_clock`: Integer counter (resets on capture, triggers draw at 50).
- `position_history`: Hash map of serialized states to repetition counts.
- **Observable information:** Complete and perfect information for both agents.
## Action space
- `place(v)`: parameter . Precondition: `phase == PLACEMENT` and `board[v] == EMPTY`.
- `move(u, v)`: parameters . Precondition: `board[u] == active_player`, `board[v] == EMPTY`, and ( or `phase == FLYING`).
- `capture(w)`: parameter . Precondition: triggered immediately following a mill-closing action; `board[w] == opponent` and (`not in_mill(w)` or `all_opponent_in_mills()`).
## Playability notes
- **Single-player-vs-AI:** Natural and direct. Well-suited for minimax with alpha-beta pruning or Monte Carlo Tree Search (MCTS).
- **Group games (n>4):** Not applicable; inherently a 1v1 duel.
- **Physical-skill games:** Not applicable; pure discrete combinatorial game.
- **What is lost in the adaptation:** The sensory and social experience of carving boards on alpine rocks or participating in lively oda spectatorship.
## Implementation hints
- Represent the 24 vertices as bitboards (three 8-bit masks corresponding to outer, middle, and inner squares) for microsecond mill-detection and move validation.
- Average branching factor in Phase 1 is ~20; in Phase 2 is ~4–8; in Phase 3 rises to ~15.
- First milestone: Implement board graph adjacency matrix, mill verification bitmasks, and valid move generator.
Download as JSON
Download the full game corpus entry for this game as structured JSON.
Download JSONCite this page
Mills / Nine Men's Morris (Kosovo). (n.d.). Games of Countries. https://gamesofcountries.com/games/xk-kosovo/cic-mic
@misc{gamesofcountries-xk-kosovo-cic-mic,
title = {Mills / Nine Men's Morris (Kosovo)},
year = {n.d.},
publisher = {Games of Countries},
url = {https://gamesofcountries.com/games/xk-kosovo/cic-mic}
}