Skip to main content
Formal Specification

Slovak Hopscotch (The Figure / Panák) — Formal Specification

Slovakia · dexterity-throw · Confidence: low

← Back to game page

Implementation Suitability

Suitability: engine-readyFidelity: probabilistic-proxyGap-fills: 2
# Skákacia škôlka — AI-optimized specification ## General idea A sequential throwing-and-hopping progression on an 8-cell topological graph where agents toss a marker stone into a target square k∈{1,…,8}, execute single-foot and straddle jumps along the path while skipping cell k, and balance on one foot to retrieve the stone before exiting the court. ## Formal model - **Abstraction taken:** The 8-cell layout is modeled as a connected planar graph where cells 1,2,3,6 require single-foot stance (Stance 1) and pairs (4,5) and (7,8) allow dual-foot stance (Stance 2). Stone throw landing error ϵthrow∼𝒩(0,σT2(k)) and hopping balance error ϵhop∼𝒩(0,σH2) determine fault probabilities. - **Player/agent count:** 2 to 6 agents. - **Turn model:** Strictly sequential turns; successful clearance advances an agent's persistent target square k←k+1. ## Formal rules R1. Setup: Graph contains 8 numbered cells. Each agent begins with target checkpoint ki=1. Total rounds capped at 30 [gap-fill]. R2. Stone Toss: The active agent throws the stone toward cell ki. - Throw success probability Ptoss(ki)=max⁡(0.20,0.95−0.08×ki). - If toss fails (lands out of bounds or on line): Turn ends immediately; agent stays at checkpoint ki. R3. Forward Hopping Traverse: If toss succeeds, agent hops through cells 1→8: - Cell ki must be skipped (no entry). - For each traversed cell/pair c, failure probability is Phop_fault=0.03. - If a hop fault occurs: Turn ends immediately; agent stays at checkpoint ki. R4. 180-Degree Pivot: In cell (7,8), the agent executes a pivot jump (Ppivot_fault=0.05). R5. Return Traverse & Retrieval: - Agent traverses backward 8→1. - In the cell immediately adjacent to ki, agent executes a single-leg bend-and-retrieve action (Pretrieve_fault=0.08). - Agent hops over cell ki and exits the court. R6. Checkpoint Advance: If all phases (R2 through R5) succeed without a fault, agent advances ki←ki+1, and immediately takes their next turn [gap-fill]. R7. Win condition: The first agent to successfully clear ki=8 (and an optional blind exit) wins the match. ## Edge cases - Tie at the end condition: Sequential turn order resolves immediately on the first agent to complete cell 8; no ties possible. - A player with no legal move: Not applicable; an agent always throws the stone at their current target checkpoint. - Repetition / cycles: Checkpoint progress ki is strictly monotonically non-decreasing. - Simultaneous claims on the same resource or position: Turns are strictly sequential; 1 agent on the court at a time. - Player elimination mid-round; turn order repair: No eliminations; standard round-robin rotation among all agents. - Resource exhaustion (pieces, tokens, space, time): Round limit of 30 guarantees temporal exhaustion. - Termination guarantee: Monotonic progress + finite round limit guarantee exact termination. ## State representation - Persistent state: `agent_checkpoints: dict[int, int] (1..8)`, `active_player_idx: int`, `round: int`. - Per-turn ephemeral state: `toss_success: bool`, `forward_hops_success: bool`, `retrieve_success: bool`. - Observable information: Fully observable — all player checkpoints and turn outcomes are public knowledge. ## Action space - `execute_hopscotch_turn(risk_profile: float)`: Submit turn attempt with focus calibration ∈[0.0,1.0]. ## Playability notes - Single-player-vs-AI: Clean solo target-and-dexterity challenge or race against AI opponents with distinct toss and balance accuracy. - Group games (n>4): Generalizes to any player count via standard round-robin rotation. - Physical-skill games: Motor balance and throwing precision are abstracted into distance-scaling Gaussian error thresholds. - What is lost in the adaptation: Tactile chalk textures, single-foot wobbling recovery, and physical stone weight balance. ## Implementation hints Very low complexity. Simple state machine over discrete graph nodes. First milestone: implement the 4-phase sequence check (Toss → Forward → Pivot → Retrieve) for 1 player.

Download as JSON

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

Download JSON
Cite this page

Slovak Hopscotch (The Figure / Panák) (Slovakia). (n.d.). Games of Countries. https://gamesofcountries.com/games/sk-slovakia/skakacia-skolka

@misc{gamesofcountries-sk-slovakia-skakacia-skolka,
  title = {Slovak Hopscotch (The Figure / Panák) (Slovakia)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/sk-slovakia/skakacia-skolka}
}