Formal Specification
Hopscotch Grid — Formal Specification
Nepal · dexterity-throw · Confidence: low
← Back to game pageImplementation Suitability
Suitability: engine-readyFidelity: probabilistic-proxyGap-fills: 2
# Khutti — AI-optimized specification
## General idea
Khutti is a grid-based discrete hopscotch game played on an 8-box graph. Agents toss a marker stone into sequential numbered boxes, hop through the track on one foot, retrieve the marker, and attempt to claim boxes as private "houses" (*ghar*).
## Formal model
- **Abstraction taken:** Court is modeled as an ordered graph of 8 zones: . Marker tosses and balancing stability are modeled with calibrated success probabilities.
- **Player/agent count:** 1 to agents (typically 2 to 4).
- **Turn model:** Sequential turns per agent.
## Formal rules
R1. Court Topology:
- Single landing nodes: 1, 2, 5, 8.
- Straddle (double) nodes: (3, 4) and (6, 7).
R2. Turn Sequence (Level ):
- Toss Marker: Agent targets Box . Toss success probability .
- If toss fails (lands on line or wrong box), turn ends progress saved at Level .
R3. Hopping Navigation:
- Agent hops forward from baseline through nodes , skipping the box containing the marker.
- Single nodes must be hopped on 1 foot; straddle nodes land with 1 foot in each box.
- [gap-fill] Hop execution stability: Each node transition has balance check . A failed check causes a step-fault turn ends.
- At Node 8 (Heaven), agent executes 180-degree pivot.
- Return path: Agent hops back to the node adjacent to the marker, retrieves the marker, and hops cleanly out of the court.
R4. House Claiming (*Ghar*):
- After successfully completing all 8 levels, the agent executes a blind toss over the shoulder.
- If marker lands cleanly in an unclaimed Box , that box becomes the agent's *Ghar*.
- *Ghar* Rules: The owner may rest with both feet inside their *Ghar*; all other agents must hop entirely over that box.
R5. Win Condition: The agent who claims 3 houses (or highest house count after all boxes claimed) wins.
## Edge cases
- Tie at the end condition: Tied house counts resolved by a sudden-death Level 8 clearance speed challenge.
- A player with no legal move: If unowned boxes are blocked by opponent houses, [gap-fill] hopping over multiple consecutive houses is permitted if stamina allows.
- Repetition / cycles: Bounded by finite 8 boxes and monotonic level completion.
- Simultaneous claims on the same resource or position: Turns and house claims are strictly sequential.
- Player elimination mid-round: Non-elimination game.
- Resource exhaustion: Total 8 boxes in court graph.
- Termination guarantee: Monotonic progress through 8 levels guarantees tournament termination.
## State representation
- `agent_levels`: Array where ().
- `house_ownership`: Array of 8 values .
- `current_agent`: Integer .
## Action space
- `toss_marker(target_box)`.
- `execute_hop_sequence()`.
- `toss_house_claim()`.
## Playability notes
- Single-player-vs-AI: Fully natural as a deterministic/stochastic level-clearing race.
- Group games (n>4): Extends cleanly up to 6 players.
- Physical-skill games: Single-leg balance and stone landing discretized into graph traversal probabilities.
- What is lost in the adaptation: The physical chalk dust and joy of jumping on outdoor stone pavements.
## Implementation hints
Graph traversal validation is simple and elegant. First milestone: implement the 8-node forward-and-return path verifier with node-skipping and house-landing rules.
Download as JSON
Download the full game corpus entry for this game as structured JSON.
Download JSONCite this page
Hopscotch Grid (Nepal). (n.d.). Games of Countries. https://gamesofcountries.com/games/np-nepal/khutti
@misc{gamesofcountries-np-nepal-khutti,
title = {Hopscotch Grid (Nepal)},
year = {n.d.},
publisher = {Games of Countries},
url = {https://gamesofcountries.com/games/np-nepal/khutti}
}