Formal Specification
Korean Abstract Board Game — Formal Specification
South Korea · board-abstract · Confidence: high
← Back to game pageImplementation Suitability
Suitability: engine-readyFidelity: directGap-fills: 2
# Gonu — AI-optimized specification
## General idea
A pure, deterministic two-player abstract strategy board game played on a planar graph (standard model: *Hobak-gonu* / Pumpkin Gonu topology). Players maneuver small piece sets along connected vertices with one-way territorial perimeter constraints, seeking to trap and immobilize all opposing pieces.
## Formal model
- **Abstraction taken:** Direct formal graph representation. Board is modeled as an undirected planar graph with vertices and edges. Vertices are partitioned into: Home (), Home (), and Central Hub ().
- **Player/agent count:** 2 agents (). Agent controls pieces ; Agent controls .
- **Turn model:** Strictly alternating single-move sequential turns.
## Formal rules
R1. **Initial State:**
- Pieces start placed on .
- Pieces start placed on .
- Central vertices start vacant.
- Active agent is , turn count .
R2. **Legal Move Definition:** On agent 's turn, they select one piece currently at vertex and move it to adjacent vertex along edge , subject to:
- Vertex must be vacant (no piece occupying ).
- **One-Way Exit Constraint:** If piece has previously transitioned out of its home set , (a piece cannot re-enter its own home loop). Re-entry into the opponent's home set is fully legal.
R3. **Immobilization Check & Win Condition:**
- At the start of agent 's turn, if agent has zero legal moves available for all 3 pieces in , agent is immobilized (trapped) and loses the game. The opposing agent wins immediately.
R4. [gap-fill] Threefold Repetition Draw:** If the exact same global board configuration (piece locations and active player) recurs three times during a match, the game ends immediately in a draw.
R5. [gap-fill] Move Limit:** If turn count reaches without an immobilization, the game is declared a draw.
## Edge cases
- Tie at the end condition: Standard folk rules have no ties (pure win/loss by trapping); R4 and R5 add draw conditions for infinite loop prevention.
- A player with no legal move: Handled by R3; having no legal move triggers an immediate loss (the fundamental win condition of the game).
- Repetition / cycles: Explicitly broken by R4 (threefold repetition draw) and R5 ( move cap).
- Simultaneous claims on the same resource or position: Not applicable; moves are sequential into vacant vertices only.
- Player elimination mid-round; turn order repair: Not applicable; pieces are never captured in Hobak-gonu.
- Resource exhaustion (pieces, tokens, space, time): Graph has 11 vertices and 6 pieces; vacancies are invariant ().
- Termination guarantee: Enforced by the finite board state space ( states) combined with R4 and R5.
## State representation
- **Persistent state:** Graph , vertex partitions , move limit .
- **Per-turn ephemeral state:** Array of piece positions , boolean array of home-exit flags , active player , turn count , position history hash map.
- **Observable information:** Fully observable; perfect information.
## Action space
- `move_piece(piece_id, target_vertex)`: Parameters: `piece_id` , `target_vertex` . Preconditions: piece is owned by active player, target is adjacent on graph , target is currently vacant, and move satisfies the one-way home exit constraint.
## Playability notes
- Single-player-vs-AI: Ideal candidate for perfect minimax / alpha-beta game tree search or MCTS. The game can be fully solved analytically in seconds due to the small state space ( states).
- Group games (n>4): Not applicable; inherently a 2-player zero-sum abstract.
- Physical-skill games: Not applicable; purely combinatorial abstract board game.
- What is lost in the adaptation: The tactile simplicity of picking up warm pebbles and scratching line diagrams into summer earth with a twig.
## Implementation hints
Very low complexity. Implement board as an adjacency list of 11 integer vertices. Total state representation fits in a single 64-bit integer bitboard. Suggested first milestone: implement the 11-node graph and legal move generator, then write an alpha-beta solver to verify optimal play from the standard starting layout.
Download as JSON
Download the full game corpus entry for this game as structured JSON.
Download JSONCite this page
Korean Abstract Board Game (South Korea). (n.d.). Games of Countries. https://gamesofcountries.com/games/kr-south-korea/gonu
@misc{gamesofcountries-kr-south-korea-gonu,
title = {Korean Abstract Board Game (South Korea)},
year = {n.d.},
publisher = {Games of Countries},
url = {https://gamesofcountries.com/games/kr-south-korea/gonu}
}