Skip to main content
Formal Specification

Jumping the Little Man (Czech Hopscotch) — Formal Specification

Czechia · dexterity-small · Confidence: low

← Back to game page

Implementation Suitability

Suitability: engine-readyFidelity: probabilistic-proxyGap-fills: 1
# Skákání panáka — AI-optimized specification ## General idea A sequential precision hopping and marker-tossing progression game across an 8-cell topological graph. An agent attempts to land a stone accurately in target cells 1…8, traverse the graph on single and dual leg landings while avoiding the target cell and boundary lines, retrieve the stone, and exit the course without faulting. ## Formal model - **Abstraction taken:** Physical stone tosses are modeled as 2D spatial samples ∼𝒩(μtarget,Σaim). Hop sequences are modeled as a series of balance checks with transition probabilities Phop(footing,skill). - **Player/agent count:** N agents (1≤N≤6, standard N=2). - **Turn model:** Sequential round-robin rotation. Active agent continues until a fault occurs or course is finished. ## Formal rules R1. Setup: Court graph G=(V,E) with nodes V={1,2,3,4,5,6,7,8}. - Single nodes (single foot required): {1,2,3,6}. - Paired nodes (two feet required simultaneously): {(4,5),(7,8)}. - Each agent i tracks completed target stage Si∈{1,…,8}, initialized to Si=1. R2. Stone Toss: - Active agent tosses stone at target node Si. - Toss success probability Ptoss(Si)=max⁡(0.40,0.95−0.05⋅Si). - If toss fails (lands on line or out of bounds): Fault occurs, turn ends immediately; Si remains unchanged. R3. Forward and Return Traverse: - If toss succeeds, agent executes traversal sequence across nodes 1…8∖{Si} and back. - Each hop transition across a single node succeeds with Psingle=0.95; across paired nodes with Ppair=0.92. - Stone retrieval balance check succeeds with Pretrieve=0.90. - Overall traverse success is the conjunction of all individual hop checks. R4. Turn Evaluation: - If all hops and retrieval succeed: Agent completes stage Si; state updates to Si←Si+1. Agent immediately takes turn for stage Si+1. - If any check fails: Turn terminates immediately; state Si is preserved. Turn passes to agent (i+1)(modN). R5. Win condition: The first agent to complete stage Si=8 and successfully exit the court wins the game immediately. R6. [gap-fill] Max round cap: If no agent completes stage 8 within 40 complete rotation rounds, the agent with the highest stage progress Si is declared the winner. ## Edge cases - Tie at the end condition: Single winner upon finishing stage 8; round cap tie broken by lowest agent ID. - A player with no legal move: Not applicable; an agent always attempts their current target square. - Repetition / cycles: Bounded by R6 maximum 40-round cap. - Simultaneous claims on the same resource: Not applicable; strictly sequential turns on isolated course. - Player elimination mid-round: If an agent disconnects, remaining agents continue round-robin rotation. - Resource exhaustion: Fixed 8-node course layout invariant across turns. - Termination guarantee: Monotonic progress checkpoints bounded strictly by R6 round limit. ## State representation - Persistent state: `player_progress: list[int]`, `active_agent: int`, `round_counter: int`. - Ephemeral turn state: `current_toss_success: bool`, `hop_outcomes: list[bool]`, `retrieval_success: bool`. - Observable information: Fully observable (all progress levels and hop outcomes are public). ## Action space - `execute_stage_attempt()`: Triggers full toss-and-hop evaluation sequence for active agent's current stage Si. ## Playability notes - Single-player-vs-AI: Natural; 1 human vs. 1 AI agent racing to clear square 8. - Group games (n>4): Scales naturally to 6 players taking turn rotations. - Physical-skill games: Ankle stability, hopping balance, and marker aim are converted into discrete probability checks. - What is lost: Physical chalk aesthetics and the physical fatigue of hopping on one leg. ## Implementation hints Low complexity. Model as an 8-state progress ladder where each turn evaluates a composite Bernoulli chain. First milestone: single agent advancing from square 1 to 8 with deterministic outcomes.

Download as JSON

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

Download JSON
Cite this page

Jumping the Little Man (Czech Hopscotch) (Czechia). (n.d.). Games of Countries. https://gamesofcountries.com/games/cz-czechia/skakani-panaka

@misc{gamesofcountries-cz-czechia-skakani-panaka,
  title = {Jumping the Little Man (Czech Hopscotch) (Czechia)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/cz-czechia/skakani-panaka}
}