Formal Specification
Segur Etug (Quantity-Guessing Game) — Formal Specification
Australia · guessing-hidden · Confidence: low
← Back to game pageImplementation Suitability
Suitability: adaptation-requiredFidelity: discretizedGap-fills: 1
# Segur Etug — AI-optimized specification
## General idea
A quantity-guessing game whose partner variant adds a real resource-transfer stake to being wrong — unlike a plain correct/incorrect guess, a wrong guess here costs something, which changes optimal guessing behaviour toward risk-averse, information-gathering play.
## Formal model
- **Abstraction taken:** the concealed quantity becomes a hidden integer within a bounded range; the partner variant's object stakes become an explicit transferable resource pool per player.
- **Player/agent count:** 4-10 in the base and team forms; exactly 2 in the partner form.
- **Turn model:** sequential — one guess at a time.
## Formal rules
R1. **Base/team form.** The concealer performs `conceal(count)`; guessers take turns `guess(count)`; the first correct guess wins that round and that guesser becomes the new concealer (or, in the team form, scores one point for their team — first to 20 wins).
R2. **Partner form.** Each of the two players starts with a fixed resource pool (e.g. 15 objects). The hider performs `hide(count)` with `1 <= count <= 5`. The guesser performs `guess(count)`.
R3. On a correct guess (R2), the hidden objects transfer to the guesser; on an incorrect guess, the guesser transfers one object to the hider.
R4. Roles swap after each round in the partner form.
R5. The partner form ends after an agreed time limit or when one player holds the entire combined pool.
## Edge cases
- **Tie at the end condition:** not applicable in any form — a single correct guess, or pool exhaustion (R5), resolves each contest.
- **Player with no legal move:** in the partner form, a player with zero objects cannot `hide()`, since there is nothing to conceal; [gap-fill] the game ends immediately in the other player's favour at that point, consistent with R5's exhaustion condition.
- **Repetition / cycles:** the base form's repeat-on-no-correct-guess (R1) is bounded in practice by the finite guesser pool exhausting plausible guesses; the partner form is explicitly bounded by R5.
- **Simultaneous claims:** not applicable — sequential single-guesser turns.
- **Mid-round elimination and turn-order repair:** not applicable — no elimination; role rotation (R4) is well-defined.
- **Resource exhaustion:** the partner form's object pool (R2-R3) is an explicit depleting/accumulating resource, central to that mode's win condition (R5).
- **Termination guarantee:** guaranteed — the team form by its fixed point target (R1), the partner form by R5's time or pool-exhaustion bound.
## State representation
Persistent: valid count range (1-5 in the partner form), resource pool sizes.
Per-round: concealer's/hider's hidden count.
Per-turn ephemeral: guesses made so far.
Information set: the concealed count is hidden from guessers until a correct guess or round end.
## Action space
- `conceal(count)` / `hide(count)` — precondition: actor is the concealer/hider, and (partner form) actor holds at least `count` objects.
- `guess(count)` — precondition: actor is a guesser.
## Playability notes
- **Single-player-vs-AI:** natural in both forms as a bounded-search puzzle; the partner form additionally rewards risk-calibrated guessing given the wrong-guess cost.
- **Group games (n>4):** the base and team forms scale directly; the partner form is inherently 2-player and would need pairing off for larger groups.
- **Physical-skill model:** not applicable — a pure bounded-information-search game.
- **What is lost:** nothing structural in the partner form, which formalizes unusually cleanly; the base form's social laughter-on-correct-guess moment (noted for moka bandi's related I-spy form) has no equivalent stake here to lose in the first place.
## Implementation hints
The partner form's wrong-guess cost (R3) is the more interesting spec to implement first — it turns a flat guessing game into one with real bisection-strategy incentives, since a guesser who guesses too broadly risks steadily losing objects over repeated rounds.
Download as JSON
Download the full game corpus entry for this game as structured JSON.
Download JSONCite this page
Segur Etug (Quantity-Guessing Game) (Australia). (n.d.). Games of Countries. https://gamesofcountries.com/games/au-australia/segur-etug
@misc{gamesofcountries-au-australia-segur-etug,
title = {Segur Etug (Quantity-Guessing Game) (Australia)},
year = {n.d.},
publisher = {Games of Countries},
url = {https://gamesofcountries.com/games/au-australia/segur-etug}
}