Formal Specification
Traditional Korean Abstract Board Games — Formal Specification
North Korea · board-abstract · Confidence: high
← Back to game pageImplementation Suitability
Suitability: engine-readyFidelity: directGap-fills: 3
# Gonu — AI-optimized specification
## General idea
A deterministic two-player alignment and capture abstract board game (formalized on the standard 4×4 *Cham-gonu* lattice with central diagonals, as excavated at Bongcheon, DPRK). Players alternate placing 12 pieces each on vacant intersections, removing an opponent piece whenever an orthogonal line of three is formed (*Gonu!*), followed by a movement phase where pieces slide one step along lines to form new three-in-a-row alignments, aiming to reduce the opponent below 3 pieces or immobilize them completely.
## Formal model
- **Abstraction taken:** None required; the rules form a complete discrete combinatorial board game.
- **Player/agent count:** 2 players (Player 1 / Black vs. Player 2 / White).
- **Turn model:** Sequential alternating turns across two distinct phases (Drop Phase then Movement Phase).
## Formal rules
R1. Board Graph: An undirected planar graph consisting of a 4×4 grid of 16 vertices with orthogonal grid edges and central square diagonal edges (24 total edges).
R2. Piece Allocation: Each player controls 12 pieces in reserve at game start.
R3. **Phase 1 (Drop Phase):**
- Players alternate placing 1 piece from reserve onto any unoccupied vertex .
- If a placement forms an unbroken orthogonal line of 3 friendly pieces (a "mill" / *Gonu*), the active player immediately selects and removes 1 opponent piece from the board to the graveyard.
- Drop phase continues until all 24 pieces have been placed (or captured).
R4. **Phase 2 (Movement Phase):**
- Players alternate selecting 1 friendly piece on the board and moving it along an incident edge to an adjacent vacant vertex.
- If a move completes a new orthogonal line of 3 friendly pieces, the active player immediately captures and removes 1 opponent piece from the board.
- Formed lines of 3 may be broken and reformed on subsequent turns to trigger repeated captures.
R5. Win conditions:
- **Material Victory:** An agent wins immediately when the opponent is reduced to fewer than 3 pieces on the board (preventing them from ever forming a line of 3).
- **Stalemate Victory:** An agent wins immediately if the opponent has no legal movement actions on their turn (all opponent pieces are immobilized/trapped).
R6. [gap-fill] Threefold Repetition: If the exact same board configuration and active player turn recurs three times, the game is declared an immediate draw.
R7. [gap-fill] Turn Limit: If 150 total moves elapse in Phase 2 without a piece capture, the match ends in a draw.
R8. [gap-fill] Capture Priority: If an opponent has pieces not involved in a line of 3, those pieces must be targeted for capture before pieces that currently form an active 3-in-a-row alignment.
## Edge cases
- **Tie at the end condition:** Possible via R6 (threefold repetition) or R7 (150-move limit without capture).
- **A player with no legal move:** In Phase 2, if a player is completely blocked with no legal moves, that player immediately loses (R5 Stalemate Victory for the opponent).
- **Repetition / cycles:** Resolved by R6 (threefold repetition draw) and R7 (150-move capture cap).
- **Simultaneous claims on the same resource or position:** Not applicable; strictly sequential alternating placements and moves.
- **Player elimination mid-round:** Not applicable (2-player game).
- **Resource exhaustion:** Captured pieces are permanently removed from play.
- **Termination guarantee:** Provably terminates due to finite board space, monotonic piece reductions, and R6/R7 repetition and turn bounds.
## State representation
- **Persistent state:** `board[16]` mapping vertex to `{Empty, Player1, Player2}`, `reserves[2]` (pieces remaining in drop phase), `phase` (`DROP` or `MOVE`), `move_count_since_capture`, `position_history`.
- **Per-turn state:** `active_player`, `pending_capture` (boolean flag if a 3-line was formed).
- **Observable information:** Perfect information, fully observable.
## Action space
- `place_piece(vertex_id)`: Valid in Phase 1 if `board[vertex_id] == Empty`.
- `move_piece(from_vertex, to_vertex)`: Valid in Phase 2 if `board[from_vertex] == active_player`, `board[to_vertex] == Empty`, and edge `(from, to) in E`.
- `capture_piece(target_vertex)`: Triggered after forming a line of 3; removes opponent piece at `target_vertex`.
## Playability notes
- **Single-player-vs-AI:** Highly engine-ready; easily solvable or playable with standard Minimax/Alpha-Beta search or MCTS.
- **Group games (n>4):** Not applicable (pure 2-player abstract).
- **What is lost in the adaptation:** None; full preservation of traditional discrete game mechanics.
## Implementation hints
Small state space (16 nodes, at most 12 pieces per player). Easily encoded into 32-bit or 64-bit integer bitboards. Branching factor is at most 16 in Phase 1 and typically 4 to 12 in Phase 2.
Download as JSON
Download the full game corpus entry for this game as structured JSON.
Download JSONCite this page
Traditional Korean Abstract Board Games (North Korea). (n.d.). Games of Countries. https://gamesofcountries.com/games/kp-north-korea/gonu
@misc{gamesofcountries-kp-north-korea-gonu,
title = {Traditional Korean Abstract Board Games (North Korea)},
year = {n.d.},
publisher = {Games of Countries},
url = {https://gamesofcountries.com/games/kp-north-korea/gonu}
}