Skip to main content
Formal Specification

Hopscotch (literally "hop paradise"; traditional Norwegian grid-hopping game) — Formal Specification

Norway · dexterity-small · Confidence: high

← Back to game page

Implementation Suitability

Suitability: engine-readyFidelity: probabilistic-proxyGap-fills: 6
# Hoppe paradis — AI-optimized specification ## General idea Hoppe paradis ("Hopscotch" / Flyver'n) is a turn-based precision tossing and acrobatic hopping race through a numbered 10-zone geometric grid. Players sequentially progress a stone marker from zone 1 through 10 (Paradis), navigating alternating single-foot and straddle jumps while avoiding lines and retrieving the marker without losing balance. ## Formal model - **Abstraction taken:** Physical stone-tossing accuracy and jumping balance are abstracted into stochastic execution checks conditioned on target zone distance and an agent skill vector θ→=(toss_accuracy,balance,stamina). The geometric grid is formalized as a discrete 10-node progression graph with topology constraints (single vs double nodes). - **Player/agent count:** 1 to 6 agents (standard model: 2 to 4 agents). - **Turn model:** Sequential round-robin turns. An agent retains the turn upon a successful level completion or yields upon committing a foul [gap-fill: standard folk rule allowing continuous play while successful]. ## Formal rules R1. **Grid Topology:** The course consists of ordered zones Z=[1,2,…,10] where zones {1,2,3,6,9} are `SINGLE`, {(4,5),(7,8)} are `DOUBLE_STRADDLE`, and zone 10 is `PARADIS` (rest and turn-around zone). R2. **Level Progression State:** Each player tracks current target level Li∈[1,10], initialized to Li=1. R3. **Toss Phase:** On player i's turn at level Li, the player throws the marker toward zone Li. Toss success probability is modeled as P(valid_toss)=σ(αtoss⋅accuracyi−β⋅Li) [gap-fill]. - If the toss fails (lands out of bounds or on a line), the turn ends immediately with a `TOSS_FOUL`. Player i remains at level Li. R4. **Hopping Execution:** If the toss succeeds, the agent executes the hop sequence traversing nodes 1…10…1, skipping zone Li. - Hopping over single nodes requires 1 foot; double nodes require 2 simultaneous feet; zone 10 permits a 180-degree pivot. - Each movement step incurs a small risk of balance failure: P(hop_success)=∏k∈path(1−pfault(k,balancei)) [gap-fill]. - At zone Li−1 (or adjacent zone on return), the player executes `pickup_marker()`. R5. **Foul Resolution:** If any balance fault or line touch occurs during the hop sequence, the turn ends with a `STEP_FOUL`. Player i remains at level Li. R6. **Level Clear & Continuation:** If the hop sequence and pickup are completed without fouls, Li←Li+1. The player immediately proceeds to level Li+1 on the same turn [gap-fill]. R7. **Victory Condition:** The first player whose target level exceeds 10 (Li=11) wins the game immediately. ## Edge cases - **Tie at the end condition:** Not applicable; turns are strictly sequential, and the first agent to clear Level 10 triggers an immediate game-ending victory. - **A player with no legal move:** Not applicable; `toss_marker()` is always legal on an active agent's turn. - **Repetition / cycles:** An agent failing attempts stays at Li. To prevent infinite loops among zero-skill bots, [gap-fill] a maximum turn limit Tmax_rounds=30 rounds is enforced; if reached, the player with the highest current level wins. - **Simultaneous claims on the same resource or position:** Not applicable; players execute hops sequentially on an isolated track. - **Player elimination mid-round; turn order repair:** No player elimination; all agents cycle turns until victory. - **Resource exhaustion:** Marker is indestructible and retrieved on each successful hop or foul reset. - **Termination guarantee:** Guaranteed by monotonic progress toward Level 10 and the global match round cap Tmax_rounds=30 [gap-fill]. ## State representation - **Persistent state:** `player_levels` (array [L1,…,LN] with Li∈[1,11]), `active_player_idx` ∈[0,N−1], `round_count` ∈[1,Tmax_rounds]. - **Per-turn state:** `marker_zone` ∈[1,10], `turn_phase` ∈{TOSS,OUTBOUND_HOP,PICKUP,RETURN_HOP}. - **Observable information:** Perfect public information. All player levels and toss/hop outcomes are visible to all agents. ## Action space - `toss_marker(target_level, aim_offset)`: Throw action with parameterized aim precision. - `hop_step(target_zone, foot_mode)`: Step execution declaring single vs straddle landing. - `pickup_marker()`: Balance retrieval action from adjacent zone. ## Playability notes - **Single-player-vs-AI:** Highly playable as an individual balance-and-accuracy solitaire challenge or race against AI ghosts. - **Group games (n>4):** Scales up to 6 players naturally via round-robin turn taking. For a 2-agent duel, agents alternate turns directly on a shared or parallel grid. - **Physical-skill games:** Physical hopping agility, single-leg isometric balance, and marker wrist snap are parameterized by scalar agent attributes. - **What is lost in the adaptation:** Physical burning in the calf muscles, playground asphalt chalk dust, and joyous celebratory balance pivots. ## Implementation hints - Model as an episodic discrete Markov Chain with deterministic transitions on success and resets on failure. - Low state complexity; branching factor per step is minimal (1 or 2 discrete actions). - Suggested first milestone: Implement deterministic level incrementing with synthetic 90% toss/hop success probabilities before integrating attribute-based sampling.

Download as JSON

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

Download JSON
Cite this page

Hopscotch (literally "hop paradise"; traditional Norwegian grid-hopping game) (Norway). (n.d.). Games of Countries. https://gamesofcountries.com/games/no-norway/hoppe-paradis

@misc{gamesofcountries-no-norway-hoppe-paradis,
  title = {Hopscotch (literally "hop paradise"; traditional Norwegian grid-hopping game) (Norway)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/no-norway/hoppe-paradis}
}