Skip to main content
Formal Specification

Korean Abstract Board Game — Formal Specification

South Korea · board-abstract · Confidence: high

← Back to game page

Implementation 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 G=(V,E) with |V|=11 vertices and |E|=14 edges. Vertices are partitioned into: Home 1 (H1={v1,v2,v3}), Home 2 (H2={v9,v10,v11}), and Central Hub (C={v4,v5,v6,v7,v8}). - **Player/agent count:** 2 agents (A1,A2). Agent A1 controls pieces P1={p1,1,p1,2,p1,3}; Agent A2 controls P2={p2,1,p2,2,p2,3}. - **Turn model:** Strictly alternating single-move sequential turns. ## Formal rules R1. **Initial State:** - Pieces P1 start placed on H1={v1,v2,v3}. - Pieces P2 start placed on H2={v9,v10,v11}. - Central vertices C={v4,v5,v6,v7,v8} start vacant. - Active agent is A1, turn count t=1. R2. **Legal Move Definition:** On agent i's turn, they select one piece p∈Pi currently at vertex u and move it to adjacent vertex w along edge (u,w)∈E, subject to: - Vertex w must be vacant (no piece occupying w). - **One-Way Exit Constraint:** If piece p has previously transitioned out of its home set Hi, w∉Hi (a piece cannot re-enter its own home loop). Re-entry into the opponent's home set H3−i is fully legal. R3. **Immobilization Check & Win Condition:** - At the start of agent i's turn, if agent i has zero legal moves available for all 3 pieces in Pi, agent i is immobilized (trapped) and loses the game. The opposing agent A3−i 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 tmax=100 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 (tmax=100 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 (|V∖(P1∪P2)|=5). - Termination guarantee: Enforced by the finite board state space (<(113)×(83)=9,240 states) combined with R4 and R5. ## State representation - **Persistent state:** Graph G=(V,E), vertex partitions (H1,H2,C), move limit tmax=100. - **Per-turn ephemeral state:** Array of piece positions 𝐩𝐨𝐬∈V6, boolean array of home-exit flags 𝐞𝐱𝐢𝐭𝐞𝐝∈{0,1}6, active player i, turn count t, position history hash map. - **Observable information:** Fully observable; perfect information. ## Action space - `move_piece(piece_id, target_vertex)`: Parameters: `piece_id` ∈{1,2,3}, `target_vertex` ∈V. Preconditions: piece is owned by active player, target is adjacent on graph G, 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 (<104 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 JSON
Cite 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}
}