Skip to main content
Formal Specification

Three-in-a-Row Stone Alignment / Cic-Mic — Formal Specification

North Macedonia · board-abstract · Confidence: low

← Back to game page

Implementation Suitability

Suitability: engine-readyFidelity: directGap-fills: 4
# Циц-миц (Триш) — AI-optimized specification ## General idea A deterministic two-player abstract alignment game played on a 9-node graph with 8 possible winning lines (3 horizontal, 3 vertical, 2 diagonal). Players alternate placing 3 stones each (Drop Phase), then slide stones along connected edges to adjacent empty nodes (Movement Phase). The first player to form an uninterrupted 3-in-a-row alignment wins immediately. ## Formal model - **Abstraction taken:** None; the traditional game already forms a finite discrete state machine. Board topology is modeled as an undirected graph G=(V,E) where |V|=9 nodes and |E|=16 edges. - **Player/agent count:** 2 players (P1 with token 1, P2 with token 2). - **Turn model:** Strictly alternating sequential turns (P1→P2→P1…). ## Formal rules R1. **Board Graph Topology:** - Node set V={0,1,2,3,4,5,6,7,8} corresponding to a 3×3 matrix: (012345678) - Edge set E includes all orthogonal adjacencies plus center diagonals through node 4: - Orthogonal: (0,1),(1,2),(3,4),(4,5),(6,7),(7,8),(0,3),(3,6),(1,4),(4,7),(2,5),(5,8). - Diagonals: (0,4),(4,8),(2,4),(4,6). - Winning lines set ℒ={(0,1,2),(3,4,5),(6,7,8),(0,3,6),(1,4,7),(2,5,8),(0,4,8),(2,4,6)}. R2. **Initial State:** Board array B∈{0,1,2}9, initialized to all 0 (empty). Hand count H1=3,H2=3. Active player =1. R3. **Phase 1 (Drop Phase):** While H1+H2>0: - Active player p submits `drop_piece(v)` where v∈V and B[v]=0. - Updates: B[v]←p, Hp←Hp−1. - Check Win: If ∃ℓ∈ℒ such that ∀u∈ℓ,B[u]=p: Player p wins immediately. - Turn passes to 3−p. R4. **Phase 2 (Movement Phase):** When H1=0 and H2=0: - Active player p submits `slide_piece(from_node, to_node)` where: - B[fromnode]=p, B[tonode]=0, and (fromnode,tonode)∈E. - Updates: B[fromnode]←0, B[tonode]←p. - Check Win: If ∃ℓ∈ℒ such that ∀u∈ℓ,B[u]=p: Player p wins immediately. - Turn passes to 3−p. R5. [gap-fill] Blockade Rule:** If an active player p in Phase 2 has 0 legal sliding moves on their turn (all 3 pieces blocked), player p loses the game and player 3−p is awarded the victory. R6. [gap-fill] Threefold Repetition Rule:** If the exact same board configuration B and active player p occurs 3 times during Phase 2, the match is declared a draw. R7. [gap-fill] Move Limit Cap:** If 60 total half-turns occur without a winning alignment, the match terminates as a draw. ## Edge cases - Tie at the end condition: Draws occur strictly upon threefold repetition (R6) or reaching the 60-turn move limit (R7). - A player with no legal move: Handled unambiguously by R5 (blockade triggers immediate loss for the blocked player). - Repetition / cycles: Handled explicitly by R6 (threefold repetition draw) and R7 (60-move hard cap). - Simultaneous claims on the same resource or position: Turns are strictly sequential; each node v holds at most one piece (B[v]∈{0,1,2}). - Player elimination mid-round: Not applicable; 1v1 complete abstract with persistent pieces. - Resource exhaustion: Exactly 3 pieces per player; placement transitions to sliding at H1=H2=0. - Termination guarantee: [gap-fill] Provably terminates due to R6 and R7 preventing infinite sliding cycles. ## State representation - **Persistent state:** Board graph G=(V,E), winning lines ℒ, match outcome ∈{Ongoing,P1 Wins,P2 Wins,Draw}. - **Per-turn ephemeral state:** Board vector B∈{0,1,2}9, pieces in hand (H1,H2), active player p∈{1,2}, state repetition history hash table, half-turn counter t∈[1,60]. - **Observable information:** Fully observable; perfect information with zero hidden state. ## Action space - `drop_piece(node_id)`: nodeid∈{0..8} with B[nodeid]=0. Valid in Phase 1 (Hp>0). - `slide_piece(src, dst)`: src,dst∈{0..8} with B[src]=p,B[dst]=0,(src,dst)∈E. Valid in Phase 2 (Hp=0). ## Playability notes - Single-player-vs-AI: Ideal for minimax with alpha-beta pruning or Monte Carlo Tree Search; fast, deep, and fully solvable. - Group games (n>4): Not applicable; inherently a 2-player abstract duel. - Physical-skill games: None; pure discrete strategy abstract. - What is lost in the adaptation: The aesthetic charm of smooth, sun-bleached river pebbles clacking against hand-carved churchyard stone steps. ## Implementation hints Very low complexity. State space is tiny (39=19,683 configurations, fewer than 500 legal states). Game tree can be completely solved in milliseconds. First milestone: implement R1–R4 and write a basic minimax agent.

Download as JSON

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

Download JSON
Cite this page

Three-in-a-Row Stone Alignment / Cic-Mic (North Macedonia). (n.d.). Games of Countries. https://gamesofcountries.com/games/mk-north-macedonia/cic-mic

@misc{gamesofcountries-mk-north-macedonia-cic-mic,
  title = {Three-in-a-Row Stone Alignment / Cic-Mic (North Macedonia)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/mk-north-macedonia/cic-mic}
}