Skip to main content
Formal Specification

Hopscotch (Greek Traditional Hopscotch) — Formal Specification

Greece · dexterity-small · Confidence: high

← Back to game page

Implementation Suitability

Suitability: engine-readyFidelity: probabilistic-proxyGap-fills: 4
# Koutso — AI-optimized specification ## General idea A turn-based, grid-traversal dexterity and territory-claiming game where agents progress through numbered cells by accurately tossing a marker and navigating hopping paths. Successfully finishing the course permits buying exclusive rest zones ("houses"), which restrict opponents' valid movement paths and eventually close the board. ## Formal model - **Abstraction taken:** Physical stone-tossing accuracy and single-leg balance maintenance are modeled via Bernoulli trials parameterized by cell distance, cell status (free vs restricted), 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 circuit completes. ## Formal rules R1. Grid Topology: 8 cells numbered 1..8 plus 1 apex cell ("Heaven", cell 9). - Single cells: 1, 2, 3, 6. - Paired cells: (4, 5) and (7, 8). - Apex: 9. R2. State tracking per agent: `target_cell` ∈{1..8}, `owned_houses` ⊂{1..8}, `turn_active` ∈{0,1}. 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.05×target_cell). - If toss fails (lands on line or outside): Agent faults; turn ends immediately. R4. Hopping Circuit Resolution: - Agent traverses cells 1→9→1, skipping the cell containing the marker. - Legality constraints: - Cannot step into a cell owned by an opponent (`owned_houses[opponent]`). - Must land with single foot in single cells, both feet in paired cells, both feet in Heaven. - [gap-fill] Traversal success probability per circuit: Phop=∏stepsPstep, where Pstep=0.95×skill. - If hop fails: Agent faults; turn ends. R5. House Acquisition: - Upon completing target cell 8, the agent executes a backward blind toss to acquire a house. - A randomly sampled unowned cell c∈{1..8} becomes that agent's `owned_house`. - The agent's `target_cell` resets to 1 for a new round. R6. Win Condition: - The game terminates when all 8 cells are claimed as houses, or when an agent owns ≥5 houses. The agent owning the most houses wins. ## Edge cases - Tie at the end condition: If all 8 houses are claimed with a 4-4 tie between 2 players, [gap-fill] the agent with fewer total lifetime faults is declared the winner. - A player with no legal move: If opponent houses block all passable routes (e.g. both paired cells 4 and 5 are owned by opponent), an agent may execute an extended leap over both cells with a higher difficulty penalty. - Repetition / cycles: Bounded — non-zero progression probabilities ensure houses are steadily acquired until all 8 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 8 discrete claimable house cells. - Termination guarantee: Enforced by the finite pool of 8 claimable cells and bounded turn limits. [gap-fill] Hard 60-turn cap triggers evaluation by highest current target progress and house count. ## State representation - Persistent state: - `cell_owners`: Array of 9 values (0: unowned, 1..K: agent IDs). - `agents`: Array of structs: `[target_cell, skill, fault_count]`. - `active_idx`: Current agent index. - `turn_count`: Total elapsed turns. - Per-turn ephemeral state: - `marker_pos`: Current target cell. - 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 circuit completion. ## 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 8-cell layout. - Physical-skill games: Balance and line-avoidance converted into probabilistic traversal checks. - What is lost: Sensory joy of drawing chalk grids and hopping on sunlit stone. ## Implementation hints - Very simple 9-cell discrete 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 (Greek Traditional Hopscotch) (Greece). (n.d.). Games of Countries. https://gamesofcountries.com/games/gr-greece/koutso

@misc{gamesofcountries-gr-greece-koutso,
  title = {Hopscotch (Greek Traditional Hopscotch) (Greece)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/gr-greece/koutso}
}