Skip to main content
Formal Specification

Školica (Croatian Hopscotch) — Formal Specification

Croatia · dexterity-small · Confidence: low

← Back to game page

Implementation Suitability

Suitability: engine-readyFidelity: probabilistic-proxyGap-fills: 2
# Školica — AI-optimized specification ## General idea A sequential level-progression agility game on an 8-node planar graph representing connected squares. Agents throw a token into incrementing target nodes, execute a sequence of single-foot and paired-foot graph hops while skipping the token node, retrieve the token on one foot, and exit to advance their level and claim node ownership. ## Formal model - **Abstraction taken:** The hopscotch grid is modeled as a connected graph G=(V,E) with nodes 1…8. Node types: SINGLE∈{1,2,3,6}, PAIRED∈{(4,5),(7,8)}. Physical hops and stone tosses are modeled via probability distributions conditioned on agent balance and motor precision. - **Player/agent count:** N agents (A1…AN, with N∈[1,6], standard N=2). - **Turn model:** Strictly sequential turn queue tracking level progression state. ## Formal rules R1. Setup: - Graph G with 8 vertices. Agent level state L(A)=1 for all agents. - Turn queue in fixed round-robin order. R2. Token Toss Action: - Active agent A attempts to throw token into target node L(A). - Throw success probability Pthrow(L)=max⁡(0.3,0.95−0.05⋅L). - If throw misses or lands on a boundary line, turn ends immediately; level L(A) remains unchanged. R3. Graph Hop Traversal: - If throw succeeds, agent traverses path 1→8→1: - In SINGLE nodes: 1-foot stance check (Phop=dexterity). - In PAIRED nodes: 2-feet simultaneous split stance. - Target node L(A) MUST be skipped on the forward path. - Claimed "house" nodes of other agents MUST be skipped. - If any balance check fails, turn ends immediately; L(A) remains unchanged. R4. Retrieval and Level Advance: - On the return traversal, agent pauses in node adjacent to L(A), retrieves token (Ppickup≈0.98), and hops out across baseline. - If run completes without faults: L(A)←L(A)+1. R5. House Claiming and Victory: - [gap-fill] When an agent completes level 8, they blind-toss token to claim a node v∗∈V as their "House". - First agent to complete level 8 and claim a house wins the match. ## Edge cases - Tie at the end condition: First agent to complete level 8 in sequential order wins immediately. - A player with no legal move: Hop action sequence is deterministically defined by graph topology. - Repetition / cycles: [gap-fill] Bounded by maximum total rounds M=30; if no agent completes level 8, agent with highest level L wins. - Simultaneous claims on the same resource or position: Grid is occupied by one agent at a time during traversal. - Player elimination mid-round; turn order repair: If an agent disconnects, their index is skipped; claimed houses revert to neutral. - Resource exhaustion: Graph structure and token are non-consumable. - Termination guarantee: Monotonically advancing level integer L∈[1,8] with strictly positive success probability per turn guarantees finite termination. ## State representation - Persistent state: `agent_levels: dict[int, int]`, `claimed_houses: dict[int, int]`, `active_agent_idx: int`, `round_count: int`. - Ephemeral turn state: `target_node: int`, `token_valid: bool`, `traversal_step: int`. - Observable information: Fully observable (all levels, house ownerships, and grid states are public). ## Action space - `throw_token(target_node: int)`: Dexterity throw action. - `execute_hop(node_id: int, stance: enum[SINGLE, PAIRED])`: Graph step action. - `retrieve_token()`: Pickup action. ## Playability notes - Single-player-vs-AI: Natural as a solo dexterity puzzle or multi-agent race. - Group games (n>4): Natively scales up to 6 agents with sequential turn sharing. - Physical-skill games: Motor accuracy parameterized by Pthrow and hop stability functions. - What is lost: Physical chalk drawing, outdoor pavement scuffs, real one-legged muscle fatigue. ## Implementation hints Discrete finite state machine with graph traversal validation. First milestone: implement 1v1 deterministic hop sequence with level incrementing before adding stochastic balance checks.

Download as JSON

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

Download JSON
Cite this page

Školica (Croatian Hopscotch) (Croatia). (n.d.). Games of Countries. https://gamesofcountries.com/games/hr-croatia/skolica

@misc{gamesofcountries-hr-croatia-skolica,
  title = {Školica (Croatian Hopscotch) (Croatia)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/hr-croatia/skolica}
}