Formal Specification
Syrian Hopscotch — Formal Specification
Syria · dexterity-small · Confidence: medium
← Back to game pageImplementation Suitability
Suitability: adaptation-requiredFidelity: probabilistic-proxyGap-fills: 1
# Al-Hajla — AI-optimized specification
## General idea
A turn-based spatial circuit game on an 8-cell linear/split grid where agents execute a sequential gauntlet of stone throws and single-foot balancing traversals. Successfully completing all 8 levels allows an agent to capture grid cells as private "Houses," altering board topology by blocking opponents while creating safe rest zones for the owner.
## Formal model
- **Abstraction taken:** Court formalized as an ordered graph of 8 nodes plus terminal node (Moon). Physical toss and balance checks are modeled via calibrated probabilistic functions: , .
- **Player/agent count:** 2 to 6 agents (standard 2-agent duel).
- **Turn model:** Sequential turn rotation; active player retains turn on success and passes turn on fault.
## Formal rules
R1. Setup: Board nodes unowned (`ownership[k] = None`). Target stage per agent . Total houses claimed .
R2. On agent 's turn, attempt to toss stone into box .
- Toss success probability .
- If toss fails (lands on line or wrong box), turn ends immediately.
R3. Traversal Phase:
- Agent hops forward from baseline to , skipping box , then hops back, retrieves stone at , and exits.
- Single boxes () require single-foot stance. Split pairs () allow double-foot landing.
- If any node is owned by opponent (), agent cannot step in and must jump over it (incurring jump penalty to balance probability).
- Hop failure probability .
R4. Level advancement: If traversal completes cleanly without fault, .
R5. House Acquisition: When , agent executes blind toss over shoulder:
- Samples random box among unowned boxes.
- If unowned, `ownership[b] = i`, , and resets to 1.
R6. Win condition: Game ends when all 8 boxes are owned, or when an agent claims houses. The agent with the most houses wins.
## Edge cases
- **Tie at the end condition:** If both players hold 4 houses each, the match is a draw.
- **A player with no legal move:** If an opponent owns two adjacent boxes making it physically impossible to leap across without landing in an owned box, [gap-fill] the trapped player is permitted a single-foot pass-through hop with elevated fault risk ().
- **Repetition / cycles:** Progress is strictly bounded by house acquisition; each successful cycle permanently locks 1 of the 8 finite boxes.
- **Simultaneous claims on the same resource or position:** Not applicable; sequential turns.
- **Player elimination mid-round; turn order repair:** Handled cleanly by circular turn skipping.
- **Resource exhaustion:** Board has exactly 8 claimable boxes; when all are claimed, the game terminates immediately.
- **Termination guarantee:** Monotonic reduction in unowned boxes ensures finite termination.
## State representation
- Persistent state:
- `ownership`: array of length 8 with values .
- `target_level`: array of length indicating current level .
- `houses_count`: array of length .
- `current_player`: integer .
- Ephemeral state: `active_toss_box` integer.
- Observable information: Fully observable.
## Action space
- `toss_marker()`: Attempt throw into target level box.
- `execute_hop_circuit()`: Execute the hop-and-retrieve routine.
- `blind_house_toss()`: Execute end-circuit house claim throw.
## Playability notes
- Single-player-vs-AI: Natural; AI calculates risk of leaping over human-owned houses and optimizes house claim selection.
- Group games (n>4): Reduces seamlessly to 2 agents.
- Physical-skill games: Motor balance modeled via compound Bernoulli chain across grid traversal.
- What is lost in the adaptation: Chalk textures, single-leg fatigue, and joyful playground shouting.
## Implementation hints
- Model the court as an array of cell structs containing type (`single`, `pair`, `moon`) and owner ID.
- Check house adjacency during hop evaluation to compute leap penalties accurately.
Download as JSON
Download the full game corpus entry for this game as structured JSON.
Download JSONCite this page
Syrian Hopscotch (Syria). (n.d.). Games of Countries. https://gamesofcountries.com/games/sy-syria/al-hajla
@misc{gamesofcountries-sy-syria-al-hajla,
title = {Syrian Hopscotch (Syria)},
year = {n.d.},
publisher = {Games of Countries},
url = {https://gamesofcountries.com/games/sy-syria/al-hajla}
}