Skip to main content
Formal Specification

Hopscotch Tile / Stepping Stones — Formal Specification

North Macedonia · dexterity-small · Confidence: low

← Back to game page

Implementation Suitability

Suitability: engine-readyFidelity: probabilistic-proxyGap-fills: 3
# Плочка (Школички) — AI-optimized specification ## General idea A turn-based sequential race through an 8-level hopscotch topological graph. Players must toss a tile accurately into the target cell, hop through the cells skipping the tile location, retrieve the tile on the return leg, and exit without stepping on boundaries or losing balance. ## Formal model - **Abstraction taken:** The physical hopscotch court is formalized as a directed acyclic graph G=(V,E) with 8 numbered cells (V={1..8}) plus start/end baseline v0 and rest zone vtop. Graph topology defines single vs paired cells. Physical hopping and toss precision are discretized into stochastic checks against player dexterity. - **Player/agent count:** 1 to 6 agents. - **Turn model:** Strictly sequential turns. A successful course traversal allows an immediate advance to the next level within the same turn. ## Formal rules R1. **Court Graph Setup:** - Single cells: {1,2,3,6} (require single-foot stance). - Paired split cells: {(4,5),(7,8)} (allow dual-foot straddle landing). - Rest cell: vtop=9 (allows dual-foot landing and 180∘ pivot). R2. **Agent State:** Each agent i maintains Leveli∈[1,8] (initially 1) and Finishedi∈{False,True}. R3. **Toss Phase:** Active agent i submits action `toss_tile(target_level)`. - Tile lands successfully in cell Leveli with probability Ptoss=1.0−0.05⋅Leveli+θaim,i. - If toss fails (lands out of bounds or on a line): the turn ends immediately; Leveli remains unchanged. R4. **Outbound Hop Phase:** Agent hops through cells 1…9, skipping cell k=Leveli: - For each visited single cell c: balance check succeeds with Phop=0.95+θbalance,i. - For paired cells: straddle jump succeeds with Pstraddle=0.98. - If any balance check fails: turn ends immediately; agent faults. R5. **Return Hop & Retrieval Phase:** Agent hops back from 9 toward 0: - Upon reaching the cell adjacent to k=Leveli, agent executes `retrieve_tile()`, succeeding with Pretrieve=0.92. - Agent hops over cell k to baseline v0. R6. **Level Advancement:** If all phases (R3, R4, R5) succeed without a fault, Leveli←Leveli+1. - If Leveli>8: Agent i sets Finishedi←True and wins the match. - If Leveli≤8: Agent i continues their turn immediately by tossing into the new target level. R7. [gap-fill] Turn Turnover:** Upon any fault in R3–R5, the turn passes to (i(modN))+1. R8. [gap-fill] Maximum Turns Cap:** Match is capped at 40 total rounds. If no agent completes Level 8, the agent with the highest level wins. ## Edge cases - Tie at the end condition: Not applicable; levels are completed sequentially in isolated turns, and the first agent to complete Level 8 wins immediately. - A player with no legal move: `toss_tile` is always legally available for the active player. - Repetition / cycles: Bounded; level progression is monotonic (ΔLevel≥0), and the 40-round cap enforces hard termination. - Simultaneous claims on the same resource or position: Turns are strictly sequential; court is clear for the active agent. - Player elimination mid-round: Not applicable; all agents persist in turn order. - Resource exhaustion: The court and tile are indestructible and persist throughout. - Termination guarantee: [gap-fill] Guaranteed by monotonic level advancement (1..8) and the 40-round upper bound. ## State representation - **Persistent state:** Number of players N, turn order list, agent level array {Leveli}i=1N, player dexterity parameters. - **Per-turn ephemeral state:** Active agent index i, target square k, tile position, current graph node position of the active hopper. - **Observable information:** Fully observable; all player levels and turn outcomes are public. ## Action space - `toss_tile(target)`: Parameter `target` ∈{1..8}. - `hop_step(node_id)`: Advance to next topological node. - `retrieve_tile()`: Pick up tile from adjacent cell. ## Playability notes - Single-player-vs-AI: Highly playable; solitaire time trial or multi-agent race against simulated AI dexterity levels. - Group games (n>4): Natively accommodates 1 to 6 players in turn rotation. - Physical-skill games: One-legged dynamic balance, isometric knee flexion, and chalk line spatial awareness are abstracted into transition probabilities. - What is lost in the adaptation: The joy of scraping colored chalk on sun-warmed concrete and the physical challenge of balancing while reaching down to grab a stone. ## Implementation hints Very low complexity. Direct graph traversal with probabilistic edge transitions and an integer level counter. First milestone: implement R1–R6 with deterministic success to verify graph traversal logic.

Download as JSON

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

Download JSON
Cite this page

Hopscotch Tile / Stepping Stones (North Macedonia). (n.d.). Games of Countries. https://gamesofcountries.com/games/mk-north-macedonia/plochka

@misc{gamesofcountries-mk-north-macedonia-plochka,
  title = {Hopscotch Tile / Stepping Stones (North Macedonia)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/mk-north-macedonia/plochka}
}