Skip to main content
Formal Specification

Kuwaiti Hopscotch — Formal Specification

Kuwait · dexterity-small · Confidence: low

← Back to game page

Implementation Suitability

Suitability: engine-readyFidelity: discretizedGap-fills: 1
# Al-Hajla — AI-optimized specification ## General idea A grid-hopping dexterity and territory-claiming game. Agents execute sequential hopping and precision foot-kicking maneuvers across a discrete linear grid, balancing kick power to avoid boundary line faults while competing to acquire private resting squares (houses). ## Formal model - **Abstraction taken:** Court is modeled as a 1D discrete track of 6 squares plus a Rest Area (`index 7`). Kicking the stone is modeled as a stochastic displacement check where landing on boundary lines causes a fault. - **Player/agent count:** `N` individual agents (`2 <= N <= 6`). - **Turn model:** Sequential turn-based rounds. ## Formal rules R1. Grid Representation: - Squares `1..6`, Rest Area `7`. - House ownership array: `houses: Array[6] of int` (-1 for unclaimed, or player ID). R2. Hopping Circuit: - Active agent hops through `1 -> 2 -> ... -> 6 -> 7 -> 6 -> ... -> 1`. - For each square `i`: - Hopping restriction: If `houses[i] == UNCLAIMED` or `houses[i] == current_player`, agent hops on 1 foot. If `houses[i] == opponent_id`, agent must jump completely over square `i`. - Kicking stone: `P(clean_kick) = precision_skill * (0.90 - 0.05 * opponent_houses)`. [gap-fill] - If kick faults: Turn ends immediately. R3. House Claim Phase: - Completing full circuit allows `throw_house_claim()`: - Stone lands in an unclaimed square `k ∈ [1..6]`. - `houses[k] = current_player`. R4. Win Condition: - Game terminates when all 6 squares are claimed. Player with the most houses wins. ## Edge cases - **Tie at the end condition:** Sudden-death single circuit playoff. - **A player with no legal move:** Multi-square jumps available across opponent houses with reduced probability. - **Repetition / cycles:** Monotonic territory acquisition ensures termination. - **Simultaneous claims on houses:** Sequential turns prevent concurrent claims. - **Player elimination mid-round:** Players do not get eliminated. - **Resource exhaustion:** 6 finite squares. - **Termination guarantee:** Guaranteed by finite board capacity. ## State representation - **Persistent state:** - `houses: Array[6] of int`. - `player_progress: Array[N] of int`. - `active_player: int`. - **Information set:** Perfect information, fully observable. ## Action space - `kick_stone_to_next_square()`: Precondition: active player turn. - `throw_house_claim()`: Precondition: completed full circuit. ## Playability notes - **Single-player-vs-AI:** Highly playable. Player balances risk on tight hopping kicks while competing with AI for central territory. - **Group games:** Scales naturally for 2 to 6 players. - **Physical-skill model:** Single-leg balance and stone foot-control are parameterized by precision ratings. - **What is lost:** Physical chalk dust and sand terrain imperfections. ## Implementation hints Model as a discrete state track of 6 cells. Calculate jump difficulty dynamically based on the number of consecutive opponent houses that must be cleared in a single hop.

Download as JSON

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

Download JSON
Cite this page

Kuwaiti Hopscotch (Kuwait). (n.d.). Games of Countries. https://gamesofcountries.com/games/kw-kuwait/al-hajla

@misc{gamesofcountries-kw-kuwait-al-hajla,
  title = {Kuwaiti Hopscotch (Kuwait)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/kw-kuwait/al-hajla}
}