Formal Specification
Hopscotch (Polish Hopscotch — Little Man & Heaven-Hell) — Formal Specification
Poland · dexterity-throw · Confidence: low
← Back to game pageImplementation Suitability
Suitability: engine-readyFidelity: probabilistic-proxyGap-fills: 3
# Gra w klasy — AI-optimized specification
## General idea
A sequential target-tossing and path-traversal grid game. Agents attempt to throw a token into an ordered sequence of topological cells (squares 1 through 8) and complete a hop-and-retrieve circuit. The strategic dimension emerges in the endgame territory claim phase (*wykupienie domu*), where conquered cells alter the permissible hopping topology for opposing agents.
## Formal model
- **Abstraction taken:** The 8-box *Chłopek* court is modeled as an undirected connected graph with nodes . Cells are single-foot nodes; and are dual-foot parallel nodes. The physical puck toss is discretized into a 2D Gaussian landing distribution .
- **Player/agent count:** 2 to 6 agents, taking sequential turns.
- **Turn model:** Sequential turns. An agent continues until completing a level or triggering a fault (*skucha*).
## Formal rules
R1. **Setup:** Graph initialized with 8 cells. Each agent starts with target class level and owned territory set .
R2. **Toss phase:** Active agent executes `toss(target_cell = L_i)`.
- Landing location is sampled: success probability .
- If the toss misses the cell boundary or lands on a line: turn ends immediately (fault), remains unchanged, and turn passes to .
R3. **Hopping circuit:** If toss succeeds, agent traverses the graph path from cell 1 to 8 and returns to cell 1:
- Cell must be skipped (inadmissible node).
- Any cell owned by an opponent is an obstacle and must be completely leapt over.
- Any cell owned by the active agent permits two-foot resting.
- Single-cell and double-cell transitions require balance checks: .
- On the return traversal at node adjacent to , agent executes `retrieve_token()`. Balance check .
R4. **Level progression:**
- If the entire hop-and-retrieve sequence is cleared with zero balance faults: .
- If : Agent immediately continues their turn by attempting the next level .
- If a fault occurs: Turn ends; is preserved.
R5. **Territory claim (*Dom*):**
- When an agent clears level , they execute a blind throw `claim_home()`.
- A random unowned cell is sampled.
- If a valid cell is hit: , and the agent scores 1 victory point.
R6. **Victory condition:**
- [gap-fill] The game terminates when all 8 cells are claimed as homes or when a player claims homes. The agent with the most claimed homes wins.
## Edge cases
- **Tie at the end condition:** If two agents hold an equal number of claimed homes when all cells are exhausted, [gap-fill] a single sudden-death toss into cell 8 resolves the tie.
- **A player with no legal move:** If all viable forward hops are blocked by opponent homes making topological traversal impossible, [gap-fill] an agent is permitted a long leap spanning 2 cells with reduced success probability .
- **Repetition / cycles:** Strictly bounded because level progress never decrements, and available unowned cells strictly decrease upon each home claim.
- **Simultaneous claims on the same resource or position:** Turns are sequential; once a cell is claimed in , it is permanently locked to agent .
- **Player elimination mid-round; turn order repair:** Not applicable; all players cycle in a fixed round-robin order.
- **Resource exhaustion:** Graph contains exactly 8 finite cells.
- **Termination guarantee:** The game state is an absorbing Markov chain whose absorbing boundary (all cells claimed) is reached in finite expected turns.
## State representation
- **Persistent state:** `class_levels: Array[Int, N]`, `owned_cells: Map[AgentId, Set[CellId]]`, `active_agent_index: 0..N-1`.
- **Per-turn ephemeral state:** `current_target_cell: 1..8`, `token_location: Option[CellId]`, `hop_path_index: Int`.
- **Observable information:** Fully observable state.
## Action space
- `toss(target_cell: Int)`: Throws marker into the designated cell.
- `hop_step(target_node: CellId)`: Move to next valid cell in graph traversal.
- `retrieve_token()`: Pick up marker from one-foot balance stance.
- `claim_home()`: Blind endgame toss to establish a home cell.
## Playability notes
- **Single-player-vs-AI:** Highly natural — individual skill optimization against AI opponents.
- **Group games (n>4):** Scales cleanly to 2–6 agents without rules alterations.
- **Physical-skill games:** Throwing precision and hopping balance parameterized by `aim_skill` and `balance_agility`.
- **What is lost:** Vestibular inner-ear balance feedback, chalk-dust tactile friction, and wind effects on marker toss.
## Implementation hints
Graph-based traversal validation is trivial to code (). First milestone: build the 1-player deterministic hopping engine and toss probability validator, then add opponent home blocking.
Download as JSON
Download the full game corpus entry for this game as structured JSON.
Download JSONCite this page
Hopscotch (Polish Hopscotch — Little Man & Heaven-Hell) (Poland). (n.d.). Games of Countries. https://gamesofcountries.com/games/pl-poland/gra-w-klasy
@misc{gamesofcountries-pl-poland-gra-w-klasy,
title = {Hopscotch (Polish Hopscotch — Little Man & Heaven-Hell) (Poland)},
year = {n.d.},
publisher = {Games of Countries},
url = {https://gamesofcountries.com/games/pl-poland/gra-w-klasy}
}