Formal Specification
Papal Morra — Formal Specification
Vatican City · guessing-hidden · Confidence: low
← Back to game pageImplementation Suitability
Suitability: engine-readyFidelity: directGap-fills: 2
# La morra pontificia — AI-optimized specification
## General idea
A simultaneous-move zero-sum matrix game of psychological arithmetic. In each round, two agents simultaneously submit an integer finger count (0..5) and an integer vocalized prediction (0..10). Exactly one agent matching the true finger sum scores 1 point; matching equally or both failing awards 0 points.
## Formal model
- **Abstraction taken:** Direct game-theoretic formalization. The rapid vocal thrust timing is formalized as simultaneous action commitment into a private reveal buffer.
- **Player/agent count:** 2 agents (Agent 1 and Agent 2).
- **Turn model:** Simultaneous move rounds.
## Formal rules
R1. Setup: Scores start at `score[1] = 0`, `score[2] = 0`. Target score is `Win_Score = 16`.
R2. Round commitment:
R2.1. Both agents simultaneously commit an action tuple `a_i = (fingers_i, call_i)`, where `fingers_i in {0, 1, 2, 3, 4, 5}` and `call_i in {fingers_i, ..., fingers_i + 5}`.
R2.2. If an agent submits an illegal tuple (`call_i < fingers_i` or `call_i > fingers_i + 5`), it is treated as a void call (`call_i = null`).
R3. Resolution:
R3.1. Compute true sum: `S = fingers_1 + fingers_2`.
R3.2. If `call_1 == S` and `call_2 != S`: `score[1] += 1`.
R3.3. If `call_2 == S` and `call_1 != S`: `score[2] += 1`.
R3.4. If `call_1 == S` and `call_2 == S`: 0 points (draw round).
R3.5. If `call_1 != S` and `call_2 != S`: 0 points (miss round).
R4. Win condition: Match terminates immediately when `max(score[1], score[2]) >= Win_Score`.
R5. [gap-fill] Tiebreak rule: If tied at target score, play continues until one agent leads by 2 points.
R6. [gap-fill] Max-round cap: A match limit of 500 rounds ensures finite termination in AI simulation environments.
## Edge cases
- Tie at the end condition: Resolved via 2-point margin rule (R5).
- A player with no legal move: Not applicable — valid action tuples are always available every round.
- Repetition / cycles: Bounded by R6 watchdog limit and positive probability of scoring on mixed-strategy Nash equilibria.
- Simultaneous claims on the same resource or position: Simultaneous correct calls resolve to a 0-point draw per R3.4.
- Player elimination mid-round: Disconnection forfeits match to the active agent.
- Resource exhaustion: Not applicable — no consumable pieces.
- Termination guarantee: Guaranteed by the finite Markov transition matrix with absorbing states at score 16.
## State representation
- Persistent state: `score` `(int, int)`, `round_count` (int), `history` (list of past move tuples).
- Per-round ephemeral state: `committed_actions` (map agent_id -> tuple).
- Observable information: Actions hidden until both committed, then fully revealed.
## Action space
- `commit_turn(fingers, call)`: Choose integers `fingers in [0, 5]` and `call in [fingers, fingers + 5]`.
## Playability notes
- Single-player-vs-AI: Exceptional — ideal for opponent pattern recognition and exploitability testing.
- Group games (n>4): King-of-the-Hill winner-stays format.
- Physical-skill games: Direct mathematical abstract.
- What is lost: The impassioned Roman dialect shouts and table-thumping bravado.
## Implementation hints
Direct 36-action discrete matrix game. Synchronous commit-reveal protocol.
Download as JSON
Download the full game corpus entry for this game as structured JSON.
Download JSONCite this page
Papal Morra (Vatican City). (n.d.). Games of Countries. https://gamesofcountries.com/games/va-vatican-city/morra-pontificia
@misc{gamesofcountries-va-vatican-city-morra-pontificia,
title = {Papal Morra (Vatican City)},
year = {n.d.},
publisher = {Games of Countries},
url = {https://gamesofcountries.com/games/va-vatican-city/morra-pontificia}
}