Skip to main content
Formal Specification

Hong Kong Aeroplane Chess (Flying Chess) — Formal Specification

Hong Kong · board-race · Confidence: high

← Back to game page

Implementation Suitability

Suitability: engine-readyFidelity: directGap-fills: 4
# Fei Hang Kei — AI-optimized specification ## General idea A discrete cross-and-circle circuit race board game based on Hong Kong Aeroplane Chess (*Fei Hang Kei*). Commanding four aeroplanes from a corner hangar, players navigate a 52-station color-coded perimeter track, execute high-speed color-hop leaps and diagonal fly-over shortcuts, capture opponent aircraft, stack friendly fleets, and land all four planes into the central terminal by exact die roll. ## Formal model - **Abstraction taken:** None required. The physical board geometry is directly formalized as a directed graph consisting of 52 perimeter nodes, 4 corner hangars, 4 launch nodes, 4 dedicated 6-node home approach corridors, and 1 central goal terminal. - **Player/agent count:** 2 to 4 players (Red, Yellow, Blue, Green), each controlling 4 plane tokens. - **Turn model:** Sequential clockwise turns. Rolling a 6 awards an immediate bonus roll. ## Formal rules R1. **Setup & Board Topology:** - Perimeter track: 52 nodes P0,…,P51 with repeating cyclic color assignments c(Pk)=k(mod4). - Each player c∈{0,1,2,3} controls 4 planes initialized in `Hangar[c]`. - Each player has a designated Launch pad Lc, Entry node Ec=P13c, Exit node Xc=P(13c+50)(mod52), and a 6-node private Runway Rc,1…Rc,6 leading to `Home[c]`. R2. **Turn Execution & Takeoff:** The active player rolls a standard fair 6-sided die (D∈{1..6}). - If D=6: The player may launch one plane from `Hangar[c]` to Lc, OR advance any plane already on track by 6 spaces. Rolling 6 grants 1 immediate bonus roll. - If D<6: The player must advance one active on-track plane by D spaces. If all planes are in `Hangar[c]`, the turn ends immediately. - Rolling three consecutive 6s triggers a *Triple-Six Crash Penalty*: all active planes on the track belonging to that player are returned to `Hangar[c]`, and the turn ends. R3. **Movement & Traversal:** - Planes move along directed edges Pk→P(k+1)(mod52). - **Color Hop (同色跳進):** If a plane finishes its move on an unoccupied node Pm of its own color (c(Pm)=c), it immediately leaps forward 4 spaces to P(m+4)(mod52). - **Super Shortcut Fly-over (超速直航):** If a plane lands on the specific corner shortcut node Pshortcut,c of its own color, it flies across the center directly to P(shortcut+12)(mod52). Any opponent planes situated on the diagonal airway node are immediately destroyed and returned to their hangars. If the destination node is also the player's color, an additional 4-space hop is executed. R4. **Collisions & Stacking:** - **Capture:** If a plane lands on a node occupied by an opponent plane, the opponent plane is shot down and returned to its hangar. - **Stacking:** If a plane lands on a node occupied by a friendly plane, they merge into a stacked fleet of size S. A stack moves as a single piece. An opponent can only capture a stack if their landing unit has fleet size ≥S. R5. **Home Runway & Exact Landing:** - Upon completing the perimeter circuit and reaching Xc, the plane enters private runway Rc,1…Rc,6. - A plane enters `Home[c]` by **exact die count**. If the roll D exceeds the remaining distance to Rc,6, the plane moves to Rc,6 and bounces backward along the runway by the excess steps (D−distance). R6. **Victory:** The first player to successfully move all 4 planes into `Home[c]` immediately wins the game. R7. [gap-fill] Board graph formalized as 52 perimeter nodes with 4 symmetric 13-node quadrants, 4 shortcut chords connecting (13c+4)→(13c+16)(mod52), and four 6-station approach runways. R8. [gap-fill] Takeoff threshold: Exact roll of 6 is required for hangar launch; each 6 grants 1 additional roll up to a hard cap of 2 bonus rolls (3rd six triggers crash penalty). R9. [gap-fill] Stack movement rules: A stacked fleet of size S advances as one unit consuming 1 roll value. A stack cannot be broken on the perimeter track; on the runway, individual planes may separate. R10. [gap-fill] Loop-breaking turn cap: Maximum 400 total player turns. If uncompleted, the player with the most planes in `Home[c]` wins; ties broken by total forward distance along track and runway. ## Edge cases - **Tie at the end condition:** Not applicable; turns are strictly sequential, ensuring a unique first player to land all 4 planes. - **A player with no legal move:** If a player has no planes launched and rolls 1..5, or all active planes are blocked by exact-roll constraints, the turn is forfeited cleanly. - **Repetition / cycles:** Aircraft circling the outer perimeter without entering the runway are bounded by R10's 400-turn cap. - **Simultaneous claims on the same resource or position:** Turns are sequential; co-location triggers deterministic capture (R4) or friendly stacking (R4). - **Player elimination mid-round:** Not applicable (4-token race to completion). - **Resource exhaustion:** Tokens are never permanently lost; shot-down planes recycle infinitely through the hangar. - **Termination guarantee:** Guaranteed by finite board size, absorbing `Home` states, and R10's 400-turn cap. ## State representation - **Persistent state:** `board_graph`, `turn_cap: 400`. - **Per-player state:** - `planes: List[Tuple[str, int]]` (Location type in `{HANGAR, TRACK, RUNWAY, HOME}`, and index) - `plane_stacks: Dict[int, List[int]]` - `consecutive_sixes: int` - **Per-turn ephemeral state:** - `active_player: int` - `current_roll: int` - `bonus_rolls_remaining: int` - `total_turns: int` - **Observable information:** Fully observable game state. All token positions, dice rolls, and flight corridors are public. ## Action space - `roll_die()`: Samples fair D∈{1..6}. - `launch_plane(plane_id)`: Moves plane from `Hangar[c]` to Lc. Preconditions: active player, D=6, `plane_id` currently in hangar. - `move_plane(plane_id)`: Advances plane (or stack containing `plane_id`) by D steps along legal directed path. Preconditions: plane is on `TRACK` or `RUNWAY`. ## Playability notes - **Single-player-vs-AI:** Highly engine-ready. Standard Expectiminimax or Monte Carlo Tree Search (MCTS) handles dice roll expectations and tactical launch/capture decisions seamlessly. - **Group games (n>4):** Natively 2 to 4 players. Can be played 1-vs-1 with each player controlling 2 opposing color teams. - **Physical-skill games:** Pure discrete board game with no physical skill component. - **What is lost in the adaptation:** Physical rolling of chunky plastic dice, tactile satisfaction of moving colorful miniature planes, and table banter. ## Implementation hints - Represent board path as integer array offsets modulo 52 for outer track, and separate 1D arrays for runway corridors. - Branching factor: At most 4 plane movement choices per dice roll (branching factor ≤4). - First milestone: Complete 2-player board simulation verifying takeoff, color hop, super shortcut jump, and exact-roll home bounce.

Download as JSON

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

Download JSON
Cite this page

Hong Kong Aeroplane Chess (Flying Chess) (Hong Kong). (n.d.). Games of Countries. https://gamesofcountries.com/games/hk-hong-kong/fei-hang-kei

@misc{gamesofcountries-hk-hong-kong-fei-hang-kei,
  title = {Hong Kong Aeroplane Chess (Flying Chess) (Hong Kong)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/hk-hong-kong/fei-hang-kei}
}