Formal Specification
Koabangan (Hidden-Object Search) — Formal Specification
Australia · guessing-hidden · Confidence: low
← Back to game pageImplementation Suitability
Suitability: adaptation-requiredFidelity: discretizedGap-fills: 2
# Koabangan — AI-optimized specification
## General idea
A race-to-find search where winning immediately grants the reward of the next hiding turn, so a fast player accumulates repeated control over where the object goes — a self-reinforcing structure worth naming as such rather than assuming uniform turn rotation.
## Formal model
- **Abstraction taken:** the search area is a grid of cells; the hidden object occupies one; searchers move and check cells until found.
- **Player/agent count:** 4+, one active hider per round, the rest searching.
- **Turn model:** ticked and simultaneous during the search phase.
## Formal rules
R1. At setup, the hider performs `hide(cell)`.
R2. Each tick, searchers may `move(direction)` and `check(cell)` if occupying it.
R3. The first searcher whose `check(cell)` matches the hidden cell wins the round and becomes the hider for the next round (R1 repeats).
R4. [gap-fill] A per-round time limit forces a re-hide if no searcher finds the object, since the source does not state what happens if the search stalls.
## Edge cases
- **Tie at the end condition:** two searchers reaching and checking the correct cell on the same tick; [gap-fill] resolved by declaring both joint winners for that round, with the next hider chosen by agreement, since the source gives no explicit tie-break.
- **Player with no legal move:** not applicable — move/check always available.
- **Repetition / cycles:** not applicable beyond the gap-filled time limit (R4).
- **Simultaneous claims:** handled explicitly in the tie case above.
- **Mid-round elimination and turn-order repair:** not applicable — no elimination.
- **Resource exhaustion:** not applicable.
- **Termination guarantee:** guaranteed by R4's time limit combined with a finite, boundable search area.
## State representation
Persistent: search area bounds, time limit.
Per-agent: position; hidden object's cell known only to the current hider.
Per-turn ephemeral: cells checked so far this round.
Information set: object location hidden from searchers until found.
## Action space
- `hide(cell)` — precondition: actor is the current hider.
- `move(direction)` / `check(cell)` — precondition: actor is a searcher.
## Playability notes
- **Single-player-vs-AI:** workable as a search-speed challenge against an AI hider's placement strategy.
- **Group games (n>4):** scales directly.
- **Physical-skill model:** none needed — pure search.
- **What is lost:** the traditional objects' connection to hunting and food practice (a cooked eye lens, a goanna claw) carries no gameplay function and is preserved only in the entry's cultural framing.
## Implementation hints
The win-grants-next-hide structure (R3) rewards search speed with repeated control — worth flagging to implementers as a possible runaway-leader dynamic if hider placement skill also varies, since a good hider-and-finder keeps winning rounds.
Download as JSON
Download the full game corpus entry for this game as structured JSON.
Download JSONCite this page
Koabangan (Hidden-Object Search) (Australia). (n.d.). Games of Countries. https://gamesofcountries.com/games/au-australia/koabangan
@misc{gamesofcountries-au-australia-koabangan,
title = {Koabangan (Hidden-Object Search) (Australia)},
year = {n.d.},
publisher = {Games of Countries},
url = {https://gamesofcountries.com/games/au-australia/koabangan}
}