Skip to main content
Formal Specification

Al-Hajla — Formal Specification

Iraq · dexterity-throw · Confidence: low

← Back to game page

Implementation Suitability

Suitability: engine-readyFidelity: probabilistic-proxyGap-fills: 2
# Al-Hajla — AI-optimized specification ## General idea A traditional Iraqi hopscotch game (*Al-Hajla* / *Al-Khutta*). Players toss a flat pottery fragment (*Tawa*) into successive numbered squares (1 to 8) of an airplane/T-grid court, hop on one leg through single squares, straddle double squares, rest at the "Sea" (*Bahr*), and retrieve the puck on the return journey without stepping on court lines. ## Formal model - **Court layout:** 8 numbered cells C1,…,C8. Cells 1, 2, 3, 6 are single; (4,5) and (7,8) are double straddle cells. - **Player/agent count:** 2 to 5 individual players. - **Turn model:** Sequential attempts across stage levels S∈[1,8]. ## Formal rules R1. **Tawa toss:** Player throws *Tawa* to target square CS. Throw must land strictly within boundaries without touching lines. - P(throw_valid)=f(Skill(A),S). R2. **Hopping traverse:** - Player hops on one leg through the court: 1 foot in single cells, 2 feet straddle in double cells. - Must skip square CS containing the *Tawa*. - Rests on both feet at (7,8) (*Bahr*), pivots 180 degrees, and hops back. R3. **Retrieval:** On return, player balances on one leg, picks up *Tawa* from CS, hops through remaining squares, and exits court. R4. **Fault triggers:** Turn passes immediately to next player if: - *Tawa* lands on a line or outside CS. - Hopper steps on any line or touches ground with non-hopping leg on single cells. - Hopper loses balance or falls. R5. **Victory condition:** First player to clear all 8 stages wins the match. R6. [gap-fill] Max turn cycles:** 15 turn cycles per player maximum. ## Edge cases - **Tie at the end condition:** Fewest total faults determines winner if multiple players finish in the same round [gap-fill]. - **A player with no legal move:** Player always attempts active stage. - **Repetition / cycles:** Monotonic stage progression bounds repetition. - **Simultaneous claims:** Turn-queue resolution. - **Player elimination mid-round:** Not applicable. - **Resource exhaustion:** Fixed 8-square court. - **Termination guarantee:** Provably terminates via monotonic progression and 15-cycle limit. ## State representation - **Persistent state:** `stage_levels: Dict[PlayerID, int \in [1,8]]`, `fault_counts: Dict[PlayerID, int]`. - **Ephemeral state:** `active_player: PlayerID`, `puck_cell: int`, `current_hopper_cell: int`. - **Observable information:** Fully observable court state. ## Action space - `throw_tawa(target_square)`: Probabilistic throw. - `hop_step(from_square, to_square)`: Hopping displacement. - `pick_up_tawa()`: Balance retrieval. ## Playability notes - **Single-player-vs-AI:** Operates as a progressive balance/accuracy skill game. - **Group games (n>4):** Scales cleanly as a turn-based queue. - **Physical-skill games:** Hopping balance and toss precision abstracted to difficulty-scaled probabilities. - **What is lost:** Chalk markings on Baghdad asphalt, clay water jar fragments, and playground songs. ## Implementation hints Discrete state machine with an array of cell types and player progression counters.

Download as JSON

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

Download JSON
Cite this page

Al-Hajla (Iraq). (n.d.). Games of Countries. https://gamesofcountries.com/games/iq-iraq/al-hajla

@misc{gamesofcountries-iq-iraq-al-hajla,
  title = {Al-Hajla (Iraq)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/iq-iraq/al-hajla}
}