Formal Specification
Three-in-a-Row Stone Alignment / Cic-Mic — Formal Specification
North Macedonia · board-abstract · Confidence: low
← Back to game pageImplementation 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 where nodes and edges.
- **Player/agent count:** 2 players ( with token 1, with token 2).
- **Turn model:** Strictly alternating sequential turns ().
## Formal rules
R1. **Board Graph Topology:**
- Node set corresponding to a matrix:
- Edge set includes all orthogonal adjacencies plus center diagonals through node 4:
- Orthogonal: .
- Diagonals: .
- Winning lines set .
R2. **Initial State:** Board array , initialized to all 0 (empty). Hand count . Active player .
R3. **Phase 1 (Drop Phase):** While :
- Active player submits `drop_piece(v)` where and .
- Updates: , .
- Check Win: If such that : Player wins immediately.
- Turn passes to .
R4. **Phase 2 (Movement Phase):** When and :
- Active player submits `slide_piece(from_node, to_node)` where:
- , , and .
- Updates: , .
- Check Win: If such that : Player wins immediately.
- Turn passes to .
R5. [gap-fill] Blockade Rule:** If an active player in Phase 2 has 0 legal sliding moves on their turn (all 3 pieces blocked), player loses the game and player is awarded the victory.
R6. [gap-fill] Threefold Repetition Rule:** If the exact same board configuration and active player 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 holds at most one piece ().
- Player elimination mid-round: Not applicable; 1v1 complete abstract with persistent pieces.
- Resource exhaustion: Exactly 3 pieces per player; placement transitions to sliding at .
- Termination guarantee: [gap-fill] Provably terminates due to R6 and R7 preventing infinite sliding cycles.
## State representation
- **Persistent state:** Board graph , winning lines , match outcome .
- **Per-turn ephemeral state:** Board vector , pieces in hand , active player , state repetition history hash table, half-turn counter .
- **Observable information:** Fully observable; perfect information with zero hidden state.
## Action space
- `drop_piece(node_id)`: with . Valid in Phase 1 ().
- `slide_piece(src, dst)`: with . Valid in Phase 2 ().
## 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 ( 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 JSONCite 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}
}