Formal Specification
Leapfrog — Formal Specification
Bulgaria · strength-endurance · Confidence: medium
← Back to game pageImplementation Suitability
Suitability: engine-readyFidelity: abstractedGap-fills: 3
# Preskochikkobila — AI-optimized specification
## General idea
A sequential queue-based athletic leapfrog game with progressive hurdle heights. Agents execute vaults over stationary base agents; successful jumps advance hurdle difficulty and extend the sequential hurdle chain, while clearance failures incur immediate role demotion to the base position.
## Formal model
- **Abstraction taken:** Gymnastic vault physics (run-up velocity, hand placement, hip elevation, leg spread) is modeled as a stochastic clearance check evaluated against hurdle height tier and agent athletic attributes.
- **Player/agent count:** agents ().
- **Turn model:** Strictly sequential queue traversal.
## Formal rules
R1. Setup:
- Hurdle height tier ().
- One agent is designated as Base Hurdle .
- Remaining agents form queue .
R2. Vault Action:
- Active agent at head of queue executes `attempt_vault(target_hurdle)`.
- [gap-fill] Clearance probability: .
R3. Outcome Resolution:
- Success ():
- Agent lands cleanly and appends to the hurdle array (or queue rear).
- If all hurdles in the active sequence are cleared: scores points.
- Failure / Fault ():
- Vault fails. is immediately demoted to become the new Base Hurdle .
- Previous base hurdle joins the rear of queue .
- Hurdle height resets to .
R4. Level Escalation:
- When all agents currently in queue successfully complete vaults at height without any fault, height tier escalates: .
R5. Level 4 Special Mechanic (Hat Balance / *S kapichka*):
- At , a stability check is added: .
- If hat falls, vault counts as a fault per R3.
R6. [gap-fill] Session Victory:
- Game terminates after full queue cycles.
- The agent with the highest accumulated clearance points (or fewest rounds spent as base hurdle ) is declared the winner.
R7. [gap-fill] Tiebreaker: If points are tied, the tied agents execute a sudden-death Level 4 vault; first to fail loses.
## Edge cases
- Tie at the end condition: Fully resolved by R7 sudden-death Level 4 vault trial.
- A player with no legal move: Not applicable — vault action is always legal on agent's turn.
- Repetition / cycles: Bounded: Each cycle either advances height or triggers a fault that resets and rotates base ; queue cycles enforce absolute session termination.
- Simultaneous claims on the same resource or position: Queue order is strictly sequential; exactly one vaulter jumps at any instant.
- Player elimination mid-round; turn order repair: If an agent disconnects from queue , queue length decrements without disrupting sequential order. If base disconnects, front of becomes the new base.
- Resource exhaustion: Not applicable — physical hurdle entities are persistent and reusable.
- Termination guarantee: Enforced by finite session limit and strictly positive failure probabilities at higher tiers ().
## State representation
- Persistent state: Cumulative agent points , agent physical attributes , session cycle counter .
- Per-vault ephemeral state: Current height tier , active base agent ID , queue array , vault outcome boolean.
- Observable information: Fully observable — all agent attributes, current height , queue order, and scores are public knowledge.
## Action space
- `attempt_vault()`: Precondition: Caller is at head of queue , base agent is set.
## Playability notes
- Single-player-vs-AI: Natural — Human controls one vaulter timing takeoff and jump commitment, competing against AI agents in the queue to maintain high difficulty tiers.
- Group games (n>4): Natively designed for ; scalable to any by queue length extension.
- Physical-skill games: Dynamic vaulting power is mapped to scalar jumping and precision attributes.
- What is lost: The physical impact of hands pressing against shoulders and the mid-air spatial sensation of spreading legs over a human back are abstracted into probabilistic clearance checks.
## Implementation hints
Extremely simple and lightweight state machine. Queue processing is per turn. Suggested first milestone: implement the -agent circular queue loop with height escalation logic and verify that height tiers cycle realistically based on clearance probabilities.
Download as JSON
Download the full game corpus entry for this game as structured JSON.
Download JSONCite this page
Leapfrog (Bulgaria). (n.d.). Games of Countries. https://gamesofcountries.com/games/bg-bulgaria/preskochikkobila
@misc{gamesofcountries-bg-bulgaria-preskochikkobila,
title = {Leapfrog (Bulgaria)},
year = {n.d.},
publisher = {Games of Countries},
url = {https://gamesofcountries.com/games/bg-bulgaria/preskochikkobila}
}