Formal Specification
Hajla (Hopscotch) — Formal Specification
Palestine · dexterity-small · Confidence: low
← Back to game pageImplementation Suitability
Suitability: engine-readyFidelity: probabilistic-proxyGap-fills: 2
# Al-Hajla — AI-optimized specification
## General idea
A hopscotch game on a geometric chalk court of numbered cells (typically 6 to 8 rectangles and a top semicircular "Rest" cell). Players toss a flat stone (*Qubqab*) into successive cells, hop through the course on one leg, kick the puck into adjacent cells without letting it touch court lines, and establish "home" cells (*Buyoot*) that opponents must skip.
## Formal model
- **Court layout:** Linear/winged sequence of cells .
- **Player/agent count:** 2 to 6 agents taking turns.
- **Turn model:** Sequential attempts per player across escalating stage tiers .
## Formal rules
R1. **Puck throw:** Player tosses puck to target cell . Throw must land completely inside cell boundaries without touching any line.
- .
R2. **Hopping traverse:**
- Player hops on one leg through the court: single hop on single cells, straddle (two feet) on paired winged cells.
- Player cannot step on cell containing the puck during the outbound journey.
- Must rest at ("The Rest"), turn around, and hop back.
R3. **Puck retrieval / kicking:** On return journey, player kicks or picks up the puck from while balanced on one leg and hops out of the court.
R4. **Fault triggers:** A player commits a fault and passes the turn if:
- Puck lands outside or on a line.
- Foot steps on a court line or touches the ground with two feet on a single cell.
- Player loses balance or puts down the non-hopping leg.
R5. **Home acquisition (Bayt):** Clearing all 8 stages entitles the player to execute a backwards toss to claim a cell as their *Bayt* (House). The owner may rest on two feet in their *Bayt*; opponents are strictly forbidden from stepping in it.
R6. **Victory:** Player who owns the most *Buyoot* after all cells are claimed (or upon clearing all stages) wins the match.
R7. [gap-fill] Max rounds:** 20 turn cycles per player maximum.
## Edge cases
- **Tie at the end condition:** Highest count of owned *Buyoot*; tiebreaker is fewest total faults [gap-fill].
- **A player with no legal move:** If all unowned cells are blocked, player attempts to jump over blocked span.
- **Repetition / cycles:** Progress across stages is monotonic per player.
- **Simultaneous claims:** Strictly turn-based.
- **Player elimination mid-round:** Players do not eliminate; turns cycle until board is fully owned.
- **Resource exhaustion:** 8 court cells, permanently claimed.
- **Termination guarantee:** Monotonic stage progression and 20-round cap.
## State representation
- **Persistent state:** `stage_progress: Dict[PlayerID, int]`, `owned_houses: Dict[int, PlayerID]`, `fault_count: Dict[PlayerID, int]`.
- **Ephemeral state:** `active_player: PlayerID`, `puck_cell: int`, `current_hopper_cell: int`.
- **Observable information:** Fully observable court state.
## Action space
- `throw_puck(target_cell)`: Probabilistic throw.
- `hop_step(from_cell, to_cell)`: Hopping move.
- `claim_house(cell_id)`: Backward toss to establish ownership.
## Playability notes
- **Single-player-vs-AI:** Operates as a balance/execution puzzle with spatial progression.
- **Group games (n>4):** Scales smoothly as turn-queue.
- **Physical-skill games:** Physical balancing and kicking accuracy mapped to probability distributions.
- **What is lost:** Real-world asphalt scuffs, ankle strain, and chalk drawing.
## Implementation hints
Discrete state machine with an array of cell states and player progress counters.
Download as JSON
Download the full game corpus entry for this game as structured JSON.
Download JSONCite this page
Hajla (Hopscotch) (Palestine). (n.d.). Games of Countries. https://gamesofcountries.com/games/ps-palestine/hajla
@misc{gamesofcountries-ps-palestine-hajla,
title = {Hajla (Hopscotch) (Palestine)},
year = {n.d.},
publisher = {Games of Countries},
url = {https://gamesofcountries.com/games/ps-palestine/hajla}
}