Skip to main content
Formal Specification

Manu ("bird" — Hawaiian fox-and-geese) — Formal Specification

Usa · board-abstract · Confidence: low

← Back to game page

Implementation Suitability

Suitability: adaptation-requiredFidelity: probabilistic-proxyGap-fills: 6
# Manu — AI-optimized specification ## General idea An asymmetric pursuit game: one player controls thirteen stationary-until-moved stones trying to trap a single mobile piece; the other player controls that one piece, which can both move and capture by jumping. Structurally similar to fox-and-geese games worldwide, distinct in its cross-shaped multi-point board and its call-and-response victory cries. ## Formal model - **Abstraction taken:** the missing starting-position figure (plate XI, b, not present in the fetched OCR text) is filled with a symmetric arrangement of the 13 stones around the cross-board's points, [gap-fill], since the actual attested layout is unavailable. - **Player/agent count:** 2, asymmetric roles (stone-side vs. puni-peki). - **Turn model:** sequential, alternating. ## Formal rules R1. [gap-fill] Setup: 13 stones occupy 13 of the board's points in a symmetric pattern around the cross; the puni-peki's stick starts on an unoccupied point of its choosing (attested: "points... to one of the unoccupied points"). R2. Stones move one adjacent point per turn along a marked line; stones cannot jump or capture (attested: stones "move one square at a time"). R3. The stick moves one adjacent point per turn, OR jumps over one adjacent stone into an empty point immediately beyond it in the same line, capturing that stone (attested). R4. [gap-fill] Turn order: this spec assumes players alternate single moves (stone-side moves one stone, then puni-peki moves/jumps), since no explicit turn-order statement survives in the source beyond the sequence of play described. R5. Stone-side wins if the stick has no legal move (no adjacent empty point, no legal jump) — attested ("Paa!"). R6. [gap-fill] Puni-peki wins if all 13 stones are captured, or (alternative reading) if enough stones are captured that trapping becomes impossible — neither threshold is attested; this spec adopts "all stones captured" as the cleanest gap-fill. ## Edge cases - Tie at end: not addressed; under R5/R6 exactly one side's win condition triggers first in any finite play line, so no draw is defined — undocumented. - No legal move for stones: stones simply pass if no adjacent point is empty (not attested as a rule, but necessary to keep the game defined) [gap-fill]. - Repetition/cycles: possible in principle (stick moving back and forth); no attested loop-breaking rule — [gap-fill] a move-limit or repetition draw is recommended for an implementation, though it changes the traditional open-ended feel. - Simultaneous claims: not applicable, sequential turns. - Player elimination: not applicable, 2-player asymmetric. - Resource exhaustion: R5 and R6 are the resource-exhaustion terminal conditions (stick immobilized; stones captured to zero). - Termination guarantee: not strictly proven — without a cycle-breaking rule the stick could evade indefinitely while capturing no stones and the stone side could fail to close a trap indefinitely; a move-limit gap-fill is needed for a provably terminating engine. ## State representation Persistent state: board graph (cross-shaped, points connected along marked lines) with each point either empty, stone-occupied, or stick-occupied. Per-player state: stone count remaining. Per-turn ephemeral: none. Full information for both players. ## Action space - `move_stone(from, to)`: one point along an edge to an empty adjacent point. - `move_stick(to)`: one point along an edge to an empty adjacent point. - `jump_stick(over, to)`: stick jumps over an adjacent stone into the empty point beyond, removing the stone. ## Playability notes - Single-player-vs-AI: natural on either side — small discrete state space suits minimax. - Group games (n>4): not applicable, but the asymmetric 2-role structure maps cleanly onto a 1-vs-1 adaptation without change. - Physical-skill games: none, purely positional. - What is lost: the true starting layout (plate XI, b) is not recoverable from this text source; any digital board geometry is a reconstruction of "four rectangles around a square, cross-shaped, all crossed with intersecting lines," not a verified diagram. ## Implementation hints The board topology (a cross of four rectangles with intersecting-line points) is the trickiest part to implement correctly without the source figure — model it as an explicit graph of points and edges rather than a rectangular grid, since it is not a simple grid. First milestone: get the point-graph right before writing any AI, since incorrect adjacency silently breaks both the trapping and jumping logic.

Download as JSON

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

Download JSON
Cite this page

Manu ("bird" — Hawaiian fox-and-geese) (Usa). (n.d.). Games of Countries. https://gamesofcountries.com/games/us-usa/manu

@misc{gamesofcountries-us-usa-manu,
  title = {Manu ("bird" — Hawaiian fox-and-geese) (Usa)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/us-usa/manu}
}