Skip to main content
Formal Specification

Hopscotch (Romanian Traditional Sotron) — Formal Specification

Romania · dexterity-small · Confidence: high

← Back to game page

Implementation Suitability

Suitability: engine-readyFidelity: probabilistic-proxyGap-fills: 4
# Șotron — AI-optimized specification ## General idea A turn-based, geometric grid-traversal and territory-claiming game. Agents advance through a numbered 10-cell figure by executing accurate stone tosses and hopping routines. Finishing the track permits buying exclusive resting cells ("căsuțe"), which restrict opponents' legal landing positions and eventually close the board. ## Formal model - **Abstraction taken:** Physical throwing accuracy and single-leg balance are modeled as Bernoulli trials parameterized by cell distance, owned house obstructions, and agent skill. - **Player/agent count:** 2 to 4 agents (default 2). - **Turn model:** Sequential turn rotation. An agent continues active hopping until a fault occurs or a full round completes. ## Formal rules R1. Grid Topology: 10 cells arranged as: - Base: 1, 2 (single or paired). - Torso: 3 (single). - Wings: 4, 5 (paired). - Center: 6 (single). - Upper Wings: 7, 8 (paired). - Heaven / Cer: 9, 10 (paired apex). R2. State tracking per agent: `target_cell` ∈{1..10}, `owned_houses` ⊂{1..10}, `lifetime_faults` ∈ℕ. R3. Marker Toss Resolution: - On active turn, agent attempts toss to `target_cell`. - [gap-fill] Toss accuracy is modeled as Ptoss=max⁡(0.20,skill−0.04×target_cell). - If toss fails (lands on line or outside): Agent faults; turn ends immediately. R4. Hopping Circuit Resolution: - Agent traverses cells 1→10→1, skipping the target marker cell. - Legality constraints: - Cannot land in any cell owned by an opponent (`owned_houses[opponent]`). - Must land single-footed in single cells, double-footed in paired cells, double-footed in Heaven. - [gap-fill] Traversal success probability: Pcircuit=(0.96×skill)Nsteps. - If circuit fails: Agent faults; turn ends. - If circuit succeeds: `target_cell += 1`. If `target_cell > 10`, circuit completes. R5. House Acquisition: - Upon completing target cell 10, the agent executes a backward blind toss to acquire a house. - A randomly sampled unowned cell c∈{1..10} becomes that agent's `owned_house`. - The agent's `target_cell` resets to 1 for a new cycle. R6. Win Condition: - The game terminates when all 10 cells are claimed as houses, or when an agent owns ≥6 houses. The agent owning the most houses wins. ## Edge cases - Tie at the end condition: If all 10 houses are claimed with a 5-5 tie between 2 players, [gap-fill] the agent with fewer `lifetime_faults` is declared the winner. - A player with no legal move: If opponent houses block both paired cells (e.g. cells 4 and 5), an agent executes an extended leap over both cells with a +0.20 difficulty penalty. - Repetition / cycles: Bounded — non-zero progression probabilities ensure houses are steadily acquired until all 10 are claimed. - Simultaneous claims on the same resource or position: Not applicable — sequential turns. - Player elimination mid-round; turn order repair: Not applicable (all agents participate until full board ownership). - Resource exhaustion: Exactly 10 discrete claimable house cells. - Termination guarantee: Enforced by the finite pool of 10 claimable cells and bounded turn limits. [gap-fill] Hard 60-turn cap triggers evaluation by highest house count. ## State representation - Persistent state: - `cell_owners`: Array of 10 values (0: unowned, 1..K: agent IDs). - `agents`: Array of structs: `[target_cell, skill, faults]`. - `active_idx`: Current agent index. - `turn_count`: Total elapsed turns. - Observable information: Fully observable. ## Action space - `toss_marker()`: Attempt toss to active target cell. - `attempt_circuit()`: Execute full hopping path. - `toss_house_claim()`: Blind toss to buy a house upon completing cell 10. ## Playability notes - Single-player-vs-AI: Engine-ready. Directly implementable as a stochastic turn loop. - Group games (n>4): Plays smoothly with 2 to 4 agents sharing the same 10-cell layout. - Physical-skill games: Physical balance and line avoidance converted into probabilistic traversal checks. - What is lost: Visual chalk artistry on sidewalks and physical balancing drama. ## Implementation hints - Compact 10-cell discrete graph topology. - First milestone: Verify that house ownership properly invalidates opponent step paths and enforces leaping difficulty.

Download as JSON

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

Download JSON
Cite this page

Hopscotch (Romanian Traditional Sotron) (Romania). (n.d.). Games of Countries. https://gamesofcountries.com/games/ro-romania/sotron

@misc{gamesofcountries-ro-romania-sotron,
  title = {Hopscotch (Romanian Traditional Sotron) (Romania)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/ro-romania/sotron}
}