Skip to main content
Formal Specification

Brajerack (The Wild Man) — Formal Specification

Australia · hide-seek · Confidence: low

← Back to game page

Implementation Suitability

Suitability: adaptation-requiredFidelity: discretizedGap-fills: 2
# Brajerack — AI-optimized specification ## General idea A hidden-information search game where the hider's single decision — which spot to occupy — is made once and then fixed, so all the ongoing decision-making belongs to the searchers dividing up the search space. ## Formal model - **Abstraction taken:** the playing area becomes a discrete set of valid hiding cells (a subset representing wombat holes or equivalent cover); the hider commits to one cell at the start and cannot relocate; seekers search cells over time. - **Player/agent count:** 1 hider, 3-19+ seekers. - **Turn model:** the hider acts once at setup; seekers then act each tick, simultaneously, until resolution. ## Formal rules R1. At setup, the hider performs `hide(cell)`, selecting one valid hiding cell; this is fixed for the round. R2. Each tick, every seeker may `move(direction)` or `search(cell)` if adjacent to or occupying a candidate hiding cell. R3. `search(cell)` reveals whether the hider occupies that cell. [gap-fill] the source's "dug out" detail implies a cell, once identified as occupied, takes additional effort to clear; modelled as `search()` succeeding only after a fixed number of consecutive ticks spent on the correct cell, rather than instantaneously. R4. The round ends in a seeker win when any seeker completes R3 successfully on the hider's cell. R5. [gap-fill] The round ends in a hider win (uncaught) after an agreed time limit, since the source's base form gives no time bound, though its indoor variant explicitly uses one (60 seconds). ## Edge cases - **Tie at the end condition:** not applicable — the round resolves to exactly one of found/not-found, no draw state. - **Player with no legal move:** not applicable — move() or search() is always available to an active seeker; the hider has no actions after R1. - **Repetition / cycles:** possible if seekers search the same wrong cells repeatedly; bounded by the gap-filled time limit (R5). - **Simultaneous claims:** not applicable — only one hider exists, so no conflict over who "found" them; the first seeker to complete R3 wins for the whole seeking side. - **Mid-round elimination and turn-order repair:** not applicable — no elimination. - **Resource exhaustion:** not applicable. - **Termination guarantee:** guaranteed by the gap-filled time limit (R5), combined with a finite cell set that guarantees discovery in bounded time if searched exhaustively. ## State representation Persistent: valid hiding-cell set, dig-out tick threshold, time limit. Per-agent: seeker position; hider's chosen cell (hidden from seekers). Per-turn ephemeral: consecutive ticks spent searching the hider's actual cell, if any seeker is there. Information set: the hider's cell is hidden from all seekers until R3 succeeds; seekers have full information about their own positions and each other's. ## Action space - `hide(cell)` — precondition: actor is the hider, round has not started. - `move(direction)` — precondition: actor is a seeker. - `search(cell)` — precondition: actor is a seeker adjacent to or occupying that cell. ## Playability notes - **Single-player-vs-AI:** natural as either role — hider choosing a cell against an AI search strategy, or a single seeker against an AI-hidden position. - **Group games (n>4):** scales naturally — more seekers simply divide the search space, which is the documented multi-seeker variant's own logic. - **Physical-skill model:** none required — this is a pure information/search game. - **What is lost:** the physical, effortful character of "digging out" a hider, reduced here to a fixed tick-threshold rather than a real excavation task; also the eyes-closed seeker variant's added handicap, which this base model does not include unless separately toggled. ## Implementation hints The dig-out threshold (R3) is what keeps this from being trivial nearest-cell search — without it, the first seeker to touch the correct cell wins instantly and hiding-spot choice barely matters. Keep it, and hiding-spot choice becomes a real trade-off between concealment and dig-out difficulty.

Download as JSON

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

Download JSON
Cite this page

Brajerack (The Wild Man) (Australia). (n.d.). Games of Countries. https://gamesofcountries.com/games/au-australia/brajerack

@misc{gamesofcountries-au-australia-brajerack,
  title = {Brajerack (The Wild Man) (Australia)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/au-australia/brajerack}
}