Formal Specification
Monégasque Boules Game — Formal Specification
Monaco · dexterity-throw · Confidence: low
← Back to game pageImplementation Suitability
Suitability: adaptation-requiredFidelity: probabilistic-proxyGap-fills: 2
# Pétanque Monégasque — AI-optimized specification
## General idea
A target-toss proximity game in 2D continuous space. Players throw boules towards a jack; closest team scores points equal to number of boules closer than opponent's best boule.
## Formal model
- **Abstraction taken:** 2D coordinate physics engine with friction and momentum collision.
- **Player count:** 2 teams (1v1, 2v2, 3v3).
- **Turn model:** Dynamic turn order: furthest team throws until holding or empty.
## Formal rules
R1. Round begins with jack placed at coordinate .
R2. Team with farthest best-boule throws next.
R3. When both teams have exhausted all boules, scoring team earns points where is the number of boules closer to than the opposing team's closest boule.
R4. First team to reach 13 points wins the match.
R5. Hard limit of 25 ends per match. [gap-fill]
## Edge cases
- **Tie at the end condition:** If two opposing boules are equidistant from the jack, and no closer boules exist, the end is void (0 points) if both teams have thrown all boules. [gap-fill]
- **A player with no legal move:** Turn automatically passes to team with remaining boules.
- **Repetition / cycles:** Fixed boule count per end guarantees end termination.
- **Simultaneous claims on the same resource or position:** Physics solver resolves collisions; identical coordinates impossible due to hard collision radius.
- **Player elimination mid-round:** Not applicable.
- **Resource exhaustion:** End completes when all boules are thrown.
- **Termination guarantee:** Match ends at 13 points or after 25 ends cap.
## State representation
- **Persistent state:** `score_team1`, `score_team2`, `current_end`.
- **Per-end state:** `jack_pos`, `boules_in_play: List[(x, y, team_id)]`, `boules_remaining: Dict[team_id, int]`.
## Action space
- `throw_boule(angle: float, force: float, spin: float)`
## Implementation hints
Represent the piste as a 2-D plane and score by distance to the cochonnet. Point-
versus-shoot can be evaluated greedily from the current end state, which makes a
one-ply lookahead agent already competitive.
## Playability notes
- **Agent decision problem:** each `throw_boule` is a choice between pointing and
shooting under uncertain execution. That choice — not the throw itself — is what
an agent reasons about, so the throw resolves as a distribution over end
positions around the aim point.
- **Group play (n>2):** played as teams; model as two coalitions alternating
throws with a shared boule pool.
- **What formalisation loses:** terrain. Real play reads gravel, slope, and the
bounce of the local pitch; the spec has only an aim point and a spread.
## Implementation hints
Represent the piste as a 2-D plane and score by distance to the cochonnet. Point-
versus-shoot can be evaluated greedily from the current end state, which makes a
one-ply lookahead agent already competitive.
Download as JSON
Download the full game corpus entry for this game as structured JSON.
Download JSONCite this page
Monégasque Boules Game (Monaco). (n.d.). Games of Countries. https://gamesofcountries.com/games/mc-monaco/petanque-monagasque
@misc{gamesofcountries-mc-monaco-petanque-monagasque,
title = {Monégasque Boules Game (Monaco)},
year = {n.d.},
publisher = {Games of Countries},
url = {https://gamesofcountries.com/games/mc-monaco/petanque-monagasque}
}