Formal Specification
Bare-Hand Basque Pelota — Formal Specification
France · ball-team · Confidence: high
← Back to game pageImplementation Suitability
Suitability: engine-readyFidelity: discretizedGap-fills: 2
# Pelote basque à main nue — AI-optimized specification
## General idea
A high-velocity wall-rebound duel where two agents (or pairs) alternate striking a hard leather ball against a shared front wall (*frontis*). Points are scored directly on rallies whenever an opponent fails to return the ball to the wall before its second floor bounce or commits a boundary foul.
## Formal model
- **Abstraction taken:** The 3D ball flight and court space are discretized into a 2D court grid where (distance from wall) and (lateral position). Wall strikes specify vertical height and rebound trajectory. Striking execution uses a probabilistic intercept-and-return model: .
- **Player/agent count:** 2 opposing agents (in 1v1) or 2 teams of 2 agents (1 forward, 1 back).
- **Turn model:** Strict alternation of returns within each rally; serving initiative goes to the rally winner.
## Formal rules
R1. Setup: Court boundaries , . Front wall at with lower foul line at . Service lines: short line , long line .
R2. Serve execution: Server bounces ball at , strikes ball against front wall at . Rebounding ball must cross on its first bounce.
- If first bounce is at : serve is short, receiver gains 1 point immediately.
- If first bounce is at : serve is long (*pasa*), server receives one re-serve attempt. [gap-fill] A second consecutive *pasa* awards 1 point to .
R3. Rally alternation: Once legal serve is in play, receiver and server alternate returns.
R4. Legal return conditions: An active agent must intercept the ball either before its first ground bounce (volley) or before its second ground bounce, and strike it so that it hits the front wall at without prior bounce.
R5. Rally loss: An agent/team loses the rally and concedes 1 point if:
- They fail to return the ball to the front wall before the second floor bounce.
- The returned ball strikes the front wall at (*chapa*).
- The returned ball lands outside lateral court bounds ().
R6. Initiative update: The winner of the rally gains 1 point and serves the next point.
R7. Match victory: Score updates by +1 per rally. First side to reach (or target 30) wins the match.
## Edge cases
- Tie at the end condition: Match ends immediately when the 22nd (or 30th) point is scored; no deuce/win-by-two is required by traditional rules.
- A player with no legal move: In a rally, if the ball is out of reach ( or double bounce), the agent cannot act and the rally is automatically resolved as conceded.
- Repetition / cycles: Infinite rallies are bounded since each return carries a non-zero probability , guaranteeing rally termination with probability 1.
- Simultaneous claims on the same resource or position: In 2v2 play, [gap-fill] the forward has priority for ball landings ; the back has priority for .
- Player elimination mid-round; turn order repair: Not applicable; 1v1/2v2 rosters are fixed throughout the match.
- Resource exhaustion (pieces, tokens, space, time): Single active ball per rally; no consumable items.
- Termination guarantee: Every rally terminates strictly in finite time () and awards 1 point, ensuring total points monotonically reach 22.
## State representation
- Persistent state: Match points , serving agent ID.
- Per-rally ephemeral state: Ball state , bounce count , active returning team, agent coordinates .
- Observable information: Full visibility of ball position and agent coordinates.
## Action space
- `serve(power, angle_z, angle_y)`: Executed by server to initiate rally.
- `strike_return(shot_type, target_z, target_y)`: Shot type . Parameters control target wall coordinates.
- `move_to(target_x, target_y)`: Moves agent across court grid to position for interception.
## Playability notes
- Single-player-vs-AI: Highly natural 1v1 discrete sports simulation.
- Group games (n>4): Not applicable; game is strictly 1v1 or 2v2.
- Physical-skill games: Modeled via movement speed limits (maximum displacement per tick) and shot error dispersion .
- What is lost in the adaptation: The intense pain management of bare-hand impact against hardened leather and the subtle acoustics of wall resonance.
## Implementation hints
Discrete tick-based loop (e.g. 50ms ticks) or event-based shot exchange loop. The event-based loop (server strikes trajectory calculates bounce time/pos receiver moves and rolls return success) is computationally trivial and highly robust. First milestone: implement 1v1 event-based rally state machine.
Download as JSON
Download the full game corpus entry for this game as structured JSON.
Download JSONCite this page
Bare-Hand Basque Pelota (France). (n.d.). Games of Countries. https://gamesofcountries.com/games/fr-france/pelote-basque-main-nue
@misc{gamesofcountries-fr-france-pelote-basque-main-nue,
title = {Bare-Hand Basque Pelota (France)},
year = {n.d.},
publisher = {Games of Countries},
url = {https://gamesofcountries.com/games/fr-france/pelote-basque-main-nue}
}