Skip to main content
Formal Specification

Louse Searching / Eye Searching — Formal Specification

Australia · hide-seek · Confidence: low

← Back to game page

Implementation Suitability

Suitability: adaptation-requiredFidelity: directGap-fills: 5
# Nem deraimer / Pone deraimer — Meriam louse/eye searching — AI-optimized specification ## General idea A hide-and-find game with an unusual "stay in until you succeed" penalty structure instead of simple turn alternation, and a distinctive real-object stake (the found item is eaten) that marks it as culturally specific rather than a generic hide-and-seek. ## Formal model - **Abstraction taken:** the physical act of searching sand by touch is replaced with a `P(find)` roll per search attempt. - **Player/agent count:** 2 sides of 4. - **Turn model:** sequential — one searcher active at a time. ## Formal rules 1. Side A supplies a searcher (initially: the player whose "louse" was taken). 2. Side B hides the token; roll `P(find)` for the searcher. 3. On success: search role passes to Side B (a Side B player is now searched next); possession of "who hides" also passes to Side A for the next round. 4. On failure: Side B reveals the hiding spot; Side A must supply the next searcher too (they remain "in"), and Side B hides again. 5. [gap-fill] Play continues for a fixed number of rounds, since the source records no overall win condition beyond the immediate find/fail cycle — this is a pastime with a role-passing structure, not a scored contest. ## Edge cases - End-condition ties: not applicable — no scoring exists to tie; [gap-fill] the game is capped at a fixed round count for implementation purposes. - A player with no legal move: cannot occur — hiding and searching are always available actions. - Repetition and cycles: a side remaining "in" repeatedly on failure is an intentional part of the design, not a bug; [gap-fill] cap consecutive failures (e.g. 10) to avoid an unbounded loop in simulation. - Simultaneous conflicting actions: not applicable — one search resolves at a time. - Mid-round elimination and turn-order repair: not applicable — no player is removed from the game; only the searcher role rotates. - Resource exhaustion: not applicable — the hidden token is reused every round. - Termination guarantee: guaranteed only by the [gap-fill] round cap; the source itself describes an open-ended pastime. ## State representation `{in_side: 'A'|'B', hiding_side: 'A'|'B', round: int, consecutive_fails: int}` ## Action space Hiding side: `hide()`. Searching side's active player: `search()`. ## Playability notes Reduction to 2 agents is natural and lossless: the game is already structured as exactly 2 sides; each agent's only real decision is which of its members searches next, which the source does not specify as a strategic choice at all. ## Implementation hints The round cap and consecutive-failure cap are [gap-fill] additions purely for termination guarantees; the eating-the-louse resolution is flavor, not a scoring mechanic, and should not be modeled as a reward signal.

Download as JSON

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

Download JSON
Cite this page

Louse Searching / Eye Searching (Australia). (n.d.). Games of Countries. https://gamesofcountries.com/games/au-australia/nem-deraimer

@misc{gamesofcountries-au-australia-nem-deraimer,
  title = {Louse Searching / Eye Searching (Australia)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/au-australia/nem-deraimer}
}