Skip to main content
Formal Specification

Petanque (Feet Anchored Boules) — Formal Specification

France · dexterity-throw · Confidence: high

← Back to game page

Implementation Suitability

Suitability: engine-readyFidelity: probabilistic-proxyGap-fills: 3
# Pétanque — AI-optimized specification ## General idea A turn-based target toss game where teams throw metal boules toward a moveable target ball (*cochonnet*) on an open 2D plane. Turn order is strictly dynamic: the team currently losing the end (holding no boule closest to the jack) must continue throwing until they regain the lead or exhaust their supply of boules. Points are scored at the end of each round based on the count of winning boules closer to the jack than the opponent's best boule. ## Formal model - **Abstraction taken:** Continuous physical rolling, aerial trajectory, and elastic collisions on gravel are abstracted into a 2D coordinate landing model parameterized by throwing intent (`point` or `shoot`), target coordinates, and a bivariate Gaussian dispersion error based on agent skill. [gap-fill] collision physics between boules and jack use 2D elastic circular disc kinematics. - **Player/agent count:** 2 teams, typically 1v1 (3 boules each), 2v2 (3 boules each), or 3v3 (2 boules each). Total boules per end = 6 per team (12 total in 2v2/3v3, or 6 total in 1v1). - **Turn model:** Dynamic priority. The team currently lacking the closest boule to the jack must execute the next throw. ## Formal rules R1. Setup: A round (*mène*) starts with throwing team A establishing the throwing circle at position C=(0,0) and placing the jack J at coordinates (xj,yj) such that ‖J−C‖∈[6.0,10.0] meters. R2. Team A throws their first boule BA,1. R3. Team B throws their first boule BB,1. R4. State evaluation: Let d(B,J)=‖B−J‖ for any active boule B. Let dA=mini⁡d(BA,i,J) and dB=minj⁡d(BB,j,J). R5. Next turn determination: - If team A has remaining boules and dA>dB, team A must throw next. - If team B has remaining boules and dB>dA, team B must throw next. - If one team has exhausted all its boules, the remaining team throws all its remaining boules consecutively. R6. [gap-fill] Tie on distance: If dA==dB exactly, the team that threw last must throw again; if neither team holds boules, the end is declared null (0 points). R7. Round scoring: When all 12 (or 6) boules are thrown, the winning team W is the team with min⁡(dW)<min⁡(dL). Team W scores S=|{BW,k|d(BW,k,J)<minm⁡d(BL,m,J)}|. R8. [gap-fill] Jack displacement: If a thrown boule displaces the jack J, the new position of J is updated immediately for all subsequent distance evaluations. If J is knocked out of bounds, and only one team has boules remaining, that team scores points equal to their remaining boules; if both or neither have boules, the end scores 0. R9. Match end: Total score TA,TB accumulates over successive ends. The first team to achieve T≥13 wins immediately. ## Edge cases - Tie at the end condition: Impossible for match victory since score increases discretely; the first team reaching 13 points wins immediately (no deuce/win-by-two requirement). - A player with no legal move: Not applicable; an active player with remaining boules always has legal action `throw_boule(type, target_coords)`. - Repetition / cycles: Bounded per end by strictly decreasing remaining boule counters (N≤12). Match termination bounded because non-null ends strictly award ≥1 point to one team. - Simultaneous claims on the same resource or position: Resolved by physical 2D disc collision model; two boules cannot occupy the exact same coordinate; the earlier boule is displaced. - Player elimination mid-round; turn order repair: Team turns are collective; if an agent within a team is skipped, the team pool simply decrements. - Resource exhaustion (pieces, tokens, space, time): When all boules in an end are thrown, round scoring is triggered immediately. - Termination guarantee: Each end consumes exactly all available boules. With non-zero probability of non-null ends scoring ≥1 point, total score monotonically approaches 13, guaranteeing finite game termination. ## State representation - Persistent state: Match scores (TA,TB)∈ℕ2, current round number, team with throwing initiative. - Per-round ephemeral state: Jack position J∈ℝ2, list of active boule positions {(Bk,teamk)}, count of unthrown boules per team (nA,nB). - Observable information: Full visibility; all positions, distances, and scores are common knowledge. ## Action space - `throw_jack(distance, angle)`: Precondition: initiative holder at start of end. Parameters: distance ∈[6,10], angle within pitch bounds. - `throw_boule(technique, target_pos)`: Technique ∈{point,shoot}. Precondition: agent belongs to team required to throw under R5. ## Playability notes - Single-player-vs-AI: Natural; 1v1 duel with 3 boules each. AI evaluates target choice (pointing to cluster near jack vs shooting to remove opponent's scoring boule). - Group games (n>4): Naturally collapses to 2 decision agents (one per team) managing a pool of 6 boules. - Physical-skill games: Skill parameterized as variance σ2 on landing position and hit-probability on direct projectile strikes. - What is lost in the adaptation: The tactile feel of ground unevenness, backspin (*effet rétro*), and micro-topography of gravel. ## Implementation hints Low state complexity. Core loop requires: (1) calculating euclidean distances from boules to jack, (2) determining dynamic turn taker, (3) updating positions via simple 2D collision resolution, (4) tallying winning boules. First milestone: implement 1v1 discrete distance simulator with pure pointing, then add shooting collision logic.

Download as JSON

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

Download JSON
Cite this page

Pétanque (France). (n.d.). Games of Countries. https://gamesofcountries.com/games/fr-france/petanque

@misc{gamesofcountries-fr-france-petanque,
  title = {Pétanque (France)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/fr-france/petanque}
}