Formal Specification
Leapfrog (Romanian Traditional Vaulting Game) — Formal Specification
Romania · dexterity-small · Confidence: high
← Back to game pageImplementation Suitability
Suitability: engine-readyFidelity: probabilistic-proxyGap-fills: 2
# De-a capra — AI-optimized specification
## General idea
A sequential, progressive dexterity and acrobatic vaulting game. Agents take turns vaulting over a central obstacle agent ("the Goat") across nine escalating difficulty stages featuring specific physical conditions (single-foot landing, mid-air item manipulation, escalating obstacle height). Any vault failure transfers the Goat role to the faulting agent.
## Formal model
- **Abstraction taken:** Acrobatic vault mechanics, body clearance, and landing stability are modeled as Bernoulli trials parameterized by goat height , round trick complexity , and individual agent agility.
- **Player/agent count:** 1 Goat () and Jumpers (, , default ).
- **Turn model:** Sequential queue traversal per round; round progresses when all jumpers succeed.
## Formal rules
R1. Setup:
- Queue of jumpers .
- Goat agent initialized at base height .
- Current round .
R2. Vault Attempt Execution:
- Each jumper executes `attempt_vault(effort)` sequentially.
- [gap-fill] Clearance success probability:
- If success = True: Jumper completes vault cleanly and returns to queue.
- If success = False: Jumper faults. Immediate role transfer: becomes the new Goat , the old Goat joins the queue, round resets to , and height resets to .
R3. Stage Progression:
- If all jumpers in complete round without faulting:
- .
- Goat height escalates: .
R4. Win Condition:
- If the jumper queue completes all 9 rounds without a single fault, all jumpers are awarded a Victory point, and the Goat must repeat as Goat for a new cycle.
R5. [gap-fill] Maximum Cycles Cap: If 30 total vault attempts occur without completing 9 rounds, the jumper with the highest cumulative success count is declared winner.
## Edge cases
- Tie at the end condition: Resolved by R5 (highest cumulative vault success count).
- A player with no legal move: Not applicable — `attempt_vault()` is always available to the active jumper.
- Repetition / cycles: Bounded by R5 (30-attempt hard limit per session).
- Simultaneous claims on the same resource or position: Not applicable — strictly sequential single-file queue.
- Player elimination mid-round; turn order repair: Role exchange dynamically updates the single Goat and jumper queue without agent count change.
- Resource exhaustion: Conserved agent population ().
- Termination guarantee: Enforced by finite 9-round progression ceiling and hard 30-attempt cap.
## State representation
- Persistent state:
- `goat_id`: Integer index.
- `jumper_queue`: List of agent IDs.
- `current_round`: Integer .
- `goat_height`: Integer .
- `total_attempts`: Integer counter.
- `success_counts`: Array of integers.
- Observable information: Fully observable.
## Action space
- `attempt_vault(effort)`: .
## Playability notes
- Single-player-vs-AI: Engine-ready. Directly implementable as a stochastic queue-progression simulator.
- Group games (n>4): Plays smoothly with jumpers.
- Physical-skill games: Physical vaulting and balance converted into parametric Bernoulli success functions.
- What is lost: Physical athletic exhilaration, mid-air cap grabbing, and Romanian rhyming banter.
## Implementation hints
- Simple linear queue processing with modular failure branches.
- First milestone: Verify that round transitions and role resets execute properly on failure.
Download as JSON
Download the full game corpus entry for this game as structured JSON.
Download JSONCite this page
Leapfrog (Romanian Traditional Vaulting Game) (Romania). (n.d.). Games of Countries. https://gamesofcountries.com/games/ro-romania/capra
@misc{gamesofcountries-ro-romania-capra,
title = {Leapfrog (Romanian Traditional Vaulting Game) (Romania)},
year = {n.d.},
publisher = {Games of Countries},
url = {https://gamesofcountries.com/games/ro-romania/capra}
}