Formal Specification
Monégasque Finger Guessing Game — Formal Specification
Monaco · guessing-hidden · Confidence: low
← Back to game pageImplementation Suitability
Suitability: engine-readyFidelity: directGap-fills: 2
# A Mourra Munegasca — AI-optimized specification
## General idea
A simultaneous zero-sum finger-extended and sum-shouted guessing game. Each player chooses fingers and a guessed sum .
## Formal model
- **Abstraction taken:** Voice audio and physical gestures abstracted to discrete tuples .
- **Player count:** 2 players.
- **Turn model:** Simultaneous actions resolved per tick.
## Formal rules
R1. Each round, both players independently choose and .
R2. The true sum is .
R3. Scoring:
- If and , Player 1 gains 1 point.
- If and , Player 2 gains 1 point.
- If and , 0 points (tie).
- If and , 0 points.
R4. First player to reach 16 points wins. [gap-fill]
R5. Hard limit of 100 rounds to guarantee termination. [gap-fill]
## Edge cases
- **Tie at the end condition:** Sudden death next point.
- **A player with no legal move:** Action space is always non-empty ().
- **Repetition / cycles:** Bounded by round limit R5.
- **Simultaneous claims on the same resource or position:** Both guessing correctly cancels out (0 points).
- **Player elimination mid-round:** Not applicable for 2 players.
- **Resource exhaustion:** Points are non-depleting counters.
- **Termination guarantee:** Guaranteed by maximum 100 rounds cap.
## State representation
- **Persistent state:** `score_p1`, `score_p2`, `round_count`.
- **Observable information:** Fully observable after simultaneous reveal.
## Action space
- `throw(fingers: 1..5, guess: 2..10)`
## Implementation hints
Payoff depends solely on whether either guess equals the sum of the two hands, so
the entire round resolves in one table lookup. Store per-opponent histograms over
declared numbers — that is where the whole game lives.
## Playability notes
- **Agent decision problem:** simultaneous-move, one action per round —
`throw(fingers, guess)` over a 5x9 joint space. Zero hidden state and zero
chance; all difficulty is opponent modelling, so a frequency-tracking or
regret-minimising agent is the natural fit.
- **Group play (n>2):** the sources describe pairwise bouts, so an n-player table
is modelled as a schedule of two-player matches rather than a single n-way round.
- **What formalisation loses:** the shouted call, its timing against the hand
reveal, and the rhythm that makes bluffing readable in person. The spec keeps
only the number pair.
## Implementation hints
Payoff depends solely on whether either guess equals the sum of the two hands, so
the entire round resolves in one table lookup. Store per-opponent histograms over
declared numbers — that is where the whole game lives.
Download as JSON
Download the full game corpus entry for this game as structured JSON.
Download JSONCite this page
Monégasque Finger Guessing Game (Monaco). (n.d.). Games of Countries. https://gamesofcountries.com/games/mc-monaco/mourra-munegasca
@misc{gamesofcountries-mc-monaco-mourra-munegasca,
title = {Monégasque Finger Guessing Game (Monaco)},
year = {n.d.},
publisher = {Games of Countries},
url = {https://gamesofcountries.com/games/mc-monaco/mourra-munegasca}
}