Skip to main content
Formal Specification

Hungarian Hopscotch (Sántika / Ickázás) — Formal Specification

Hungary · dexterity-throw · Confidence: medium

← Back to game page

Implementation Suitability

Suitability: engine-readyFidelity: probabilistic-proxyGap-fills: 3
# Ugróiskola — AI-optimized specification ## General idea A turn-based sequential progression game on an 8-cell topological graph where agents execute a series of precision stone tosses into advancing target cells followed by a deterministic jumping traverse with stochastic balance maintenance and retrieval checks. ## Formal model - **Abstraction taken:** The 8-cell layout is modeled as a connected 1D topological node ladder with nodes V={1,2,3,(4,5),6,(7,8)}. A turn consists of a stone-toss trial into target cell g∈{1…8} with landing accuracy modeled via 2D Gaussian landing error, followed by a sequence of cell-traversal balance checks with failure probability P(fault)=f(step_type,skill). - **Player/agent count:** 1 to 6 agents. - **Turn model:** Sequential fixed rotation; an agent continues their turn until a throw error or traverse fault occurs. ## Formal rules R1. Setup: - 8 target grades G=[1,2,3,4,5,6,7,8]. - Each agent starts at `current_grade` =1. R2. Stone Toss Trial: - Active agent tosses stone at cell center Cg=(xg,yg). - Landing point Pland=Cg+𝒩(0,σtoss2). - Toss success condition: Pland lies within cell bounding box [xg±W/2,yg±H/2] with margin δ=0.03 m away from all grid lines [gap-fill]. - If toss fails: Turn ends immediately; agent stays at `current_grade`. R3. Traversal Phase: - If toss succeeds, agent executes the traverse sequence 1→8→1, skipping cell g. - Single cell hop: Success probability Phop=min⁡(0.98,Balance_Skill−0.05). - Paired cell landing: Success probability Ppair=min⁡(0.99,Balance_Skill−0.02). - Top turnaround: Success probability Pturn=min⁡(0.95,Balance_Skill−0.10) [gap-fill]. - One-legged retrieval of stone at cell g: Success probability Pretrieve=min⁡(0.96,Balance_Skill−0.08). R4. Turn Handover & Advancement: - If all traversal checks in R3 succeed: Agent completes the grade; `current_grade` increments by 1. Agent immediately takes their next turn if `current_grade` ≤8. - If any traversal check fails: Agent commits a fault; turn ends immediately. R5. Win condition: The first agent to complete Grade 8 and the final graduation traverse wins the game. ## Edge cases - Tie at the end condition: In multiplayer play, if multiple agents complete Grade 8 in the same rotation round, a sudden-death Grade 8 speed trial breaks the tie [gap-fill]. - A player with no legal move: Not applicable; stone toss is always the sole mandatory action at the start of a turn. - Repetition / cycles: Bounded by the monotonically non-decreasing grade progression g∈{1…8}. - Simultaneous claims on the same resource or position: Turns are strictly sequential; only one agent is on the court at any time. - Player elimination mid-round; turn order repair: No elimination; failed turns simply yield play to the next agent in rotation. - Resource exhaustion (pieces, tokens, space, time): Exactly 1 stone per player, grid is static and non-depleting. - Termination guarantee: Because P(success)>0 for all skill levels, an agent provably clears all 8 grades in finite expected turns. ## State representation - Persistent state: `active_player: int`, `grades_completed: dict[int, int] (0..8)`, `owned_houses: dict[int, set[int]]`. - Per-turn ephemeral state: `target_grade: int`, `toss_landed: bool`, `traverse_success: bool`. - Observable information: Fully observable. All agents see court layouts, stone landing spots, and grade progress. ## Action space - `toss_stone(target_cell: int)`: Execute the stone throwing trial. - `execute_traverse()`: Execute the deterministic hopping progression with balance checks. ## Playability notes - Single-player-vs-AI: Ideal single-player time/turn optimization challenge (finish all 8 grades in minimum turns) or turn-based race against AI opponents. - Group games (n>4): Scales cleanly up to 6 players with standard turn rotation. - Physical-skill games: Dynamic hopping balance and precision underhand throwing are abstracted into calibrated Gaussian noise and Bernoulli hurdle checks. - What is lost in the adaptation: Surface chalk friction, leg fatigue, wind drift, and physical stone weight. ## Implementation hints Very low complexity. Straightforward finite state machine tracking integer grade from 1 to 8 with standard random number generation. First milestone: Implement deterministic 1-to-8 step progression with 100% success rate, then calibrate toss and hop probability parameters.

Download as JSON

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

Download JSON
Cite this page

Hungarian Hopscotch (Sántika / Ickázás) (Hungary). (n.d.). Games of Countries. https://gamesofcountries.com/games/hu-hungary/ugroiskola

@misc{gamesofcountries-hu-hungary-ugroiskola,
  title = {Hungarian Hopscotch (Sántika / Ickázás) (Hungary)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/hu-hungary/ugroiskola}
}