Skip to main content
Formal Specification

Paliwan (Home-Base Hide-and-Seek) — Formal Specification

Australia · hide-seek · Confidence: low

← Back to game page

Implementation Suitability

Suitability: adaptation-requiredFidelity: discretizedGap-fills: 1
# Paliwan — AI-optimized specification ## General idea A two-phase hide-and-seek: a static hiding phase followed by a chase phase once spotted, with a rule that specifically denies seekers the easy strategy of camping the goal — home must be earned by searching, not by waiting. ## Formal model - **Abstraction taken:** the field is a grid with valid hiding cells and a home cell; a no-camp exclusion zone around home enforces R4. - **Player/agent count:** 1 hider, up to 19 seekers. - **Turn model:** ticked and simultaneous once the chase phase begins; the hiding phase is a single setup action. ## Formal rules R1. At setup, the hider performs `hide(cell)`. R2. Each tick, seekers may `move(direction)`; seekers within line-of-sight range of the hider's cell `spot()` them, ending the hiding phase. R3. Seeker agents may not occupy any cell within a fixed radius of the home cell (the no-camp exclusion, R4 in the entry). R4. Once spotted, the hider performs `move(direction)` each tick toward home; seekers pursue. R5. If the hider reaches the home cell before any seeker occupies the hider's cell, the hider wins. R6. If a seeker occupies the hider's cell before home is reached, the seeker catches the hider and wins. ## Edge cases - **Tie at the end condition:** not applicable — home-reached and caught are mutually exclusive, resolved at the tick a cell is occupied. - **Player with no legal move:** not applicable — movement is always available in open space. - **Repetition / cycles:** possible during the search phase if the hider is never spotted; [gap-fill] a time limit ends the hiding phase in a hider win, since the source implies active searching rather than indefinite play. - **Simultaneous claims:** not applicable — one hider, so no contest over who caught them. - **Mid-round elimination and turn-order repair:** not applicable — no elimination, single round per hider. - **Resource exhaustion:** not applicable. - **Termination guarantee:** guaranteed by the gap-filled search time limit plus the finite chase (bounded field, so the chase resolves in finite ticks). ## State representation Persistent: field bounds, home-cell location and exclusion radius, search time limit. Per-agent: position; hider's cell hidden from seekers until spotted. Per-turn ephemeral: spotted status. Information set: hider's location hidden until spotted (R2); fully observable afterward. ## Action space - `hide(cell)` — precondition: actor is the hider, setup phase. - `move(direction)` — precondition: none. - `spot()` — implicit on seeker-hider line-of-sight. ## Playability notes - **Single-player-vs-AI:** natural as either role — the no-camp rule is exactly the kind of constraint that makes an AI seeker's strategy interesting to design around. - **Group games (n>4):** scales directly, up to 20. - **Physical-skill model:** none needed — pure positional search and chase. - **What is lost:** nothing structural; this formalizes cleanly. ## Implementation hints Implement the no-camp exclusion zone (R3) as a hard constraint, not a penalty — it is the one rule that distinguishes this from generic hide-and-seek-then-tag, and a soft penalty would let seekers camp anyway if the penalty is cheap enough.

Download as JSON

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

Download JSON
Cite this page

Paliwan (Home-Base Hide-and-Seek) (Australia). (n.d.). Games of Countries. https://gamesofcountries.com/games/au-australia/paliwan

@misc{gamesofcountries-au-australia-paliwan,
  title = {Paliwan (Home-Base Hide-and-Seek) (Australia)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/au-australia/paliwan}
}