Formal Specification
Egyptian Hopscotch — Formal Specification
Egypt · dexterity-small · Confidence: medium
← Back to game pageImplementation Suitability
Suitability: engine-readyFidelity: probabilistic-proxyGap-fills: 2
# Al-Oula — AI-optimized specification
## General idea
A turn-based positional race and territory-acquisition game. Agents complete a progressive sequence of 8 target landing stages on a discrete grid by executing stochastic marker tosses and one-legged hop traversals, eventually purchasing restricted-access "house" cells.
## Formal model
- **Abstraction taken:** Physical stone-throwing accuracy and hopping balance are modeled via stochastic success functions parameterized by target difficulty and agent dexterity/balance attributes.
- **Player/agent count:** 2 to 6 agents (sequential rotation).
- **Turn model:** Sequential; an agent's turn continues through successive stages until a foul occurs.
## Formal rules
R1. The grid consists of 8 cells numbered 1 through 8. Configuration: 1, 2, 3 (single-step cells), (4,5) (paired wing cells), 6 (single cell), (7,8) (paired top cells).
R2. Progress state per agent is tracked as `current_stage ∈ {1..8}` and `houses_owned ⊆ {1..8}`.
R3. Stage Execution:
- Step 1 (Toss): Agent attempts to throw the stone into `current_stage`. Success probability .
- Step 2 (Traverse): If toss succeeds, agent executes a hop sequence across cells 1..8 and back. Success probability .
R4. If both toss and traversal succeed, `current_stage` increments by 1; the agent immediately attempts the next stage.
R5. If either toss or traversal fails (foul), the turn ends immediately; `current_stage` remains unchanged for the agent's next turn.
R6. House Acquisition: Once an agent completes Stage 8, they execute a blind toss (). On success, a random unoccupied cell becomes that agent's private `House`.
R7. [gap-fill] Restricted Movement: An agent cannot enter an opponent's House; jumping over an opponent's House incurs an additional balance penalty of to .
R8. [gap-fill] Max Rounds / Termination: If no agent completes all stages within 20 turn cycles per player, the agent with the highest stage / most houses wins.
R9. Win condition: First agent to acquire 3 Houses (or the most houses after 20 cycles) wins.
## Edge cases
- Tie at the end condition: Highest stage progress breaks ties; if equal, sudden-death Stage 8 toss.
- A player with no legal move: Not applicable; an agent always attempts their current stage toss.
- Repetition / cycles: Bounded by the 20-cycle hard limit (R8).
- Simultaneous claims on the same resource or position: Turns are sequential; a cell claimed as a House is permanently locked to that agent.
- Player elimination mid-round; turn order repair: In standard play no agent is eliminated; rotation order is fixed.
- Resource exhaustion (pieces, tokens, space, time): Only 8 grid cells exist; maximum 8 total houses can be owned.
- Termination guarantee: Guaranteed by the 20-cycle limit and monotonic stage completion.
## State representation
- Persistent state:
- `agent_progress`: map of `agent_id` to `{stage: int, houses: set[int]}`.
- `turn_cycle_count`: integer.
- `active_agent_index`: integer in `0..n-1`.
- Per-turn ephemeral state: `toss_success: bool`, `hop_success: bool`.
- Observable information: Fully observable by all agents.
## Action space
- `execute_stage()`: perform the toss and hop action for the current stage.
- `claim_house_toss()`: perform blind toss upon completing stage 8.
## Playability notes
- Single-player-vs-AI: Engine-ready; play as a solitaire challenge (fewest fouls to complete 8 stages) or against AI opponent.
- Group games (n>4): Reduces naturally; turn rotation generalizes seamlessly to any .
- Physical-skill games: Motor skills (proprioception, jump balance) parameterized as probability functions of target distance and player balance attribute.
- What is lost in adaptation: Physical exertion and micro-balancing maneuvers are abstracted into probabilities.
## Implementation hints
Extremely simple state machine. First milestone: implement the 8-stage progress tracker and turn rotation with mock uniform random probabilities before adding house restrictions.
Download as JSON
Download the full game corpus entry for this game as structured JSON.
Download JSONCite this page
Egyptian Hopscotch (Egypt). (n.d.). Games of Countries. https://gamesofcountries.com/games/eg-egypt/oula
@misc{gamesofcountries-eg-egypt-oula,
title = {Egyptian Hopscotch (Egypt)},
year = {n.d.},
publisher = {Games of Countries},
url = {https://gamesofcountries.com/games/eg-egypt/oula}
}