Skip to main content
Formal Specification

Spanning and Meter — Formal Specification

Palestine · strength-endurance · Confidence: low

← Back to game page

Implementation Suitability

Suitability: engine-readyFidelity: abstractedGap-fills: 5
# Shibr wa Mitr — AI-optimized specification ## General idea A progressive hurdle-jumping game where a seated player sets up an obstacle whose height increases through discrete traditional measurements (flat legs, stacked feet, single hand-span *shibr*, double span *shibrayn*, and full meter *mitr*). Jumpers clear each level in turn; any physical contact with the obstacle triggers an immediate role swap. ## Formal model - **Abstraction taken:** Hurdle height is modeled as a discrete difficulty level L∈{1,2,3,4,5}. Jumping execution is modeled as a probabilistic clearance check parameterized by agent agility and level difficulty. - **Player/agent count:** 3 to 10 agents (1 `Base` obstacle, N−1 `Jumpers` in queue). - **Turn model:** Sequential leaps per level. ## Formal rules R1. **Initial setup:** Agent A0 is designated as the initial `Base`. Level starts at L=1. R2. **Jump attempt:** For each jumper Ai in the queue: - Clearance probability: P(clear)=1.0−(L×0.15)+(Agility(Ai)×0.05) [gap-fill]. - If clear is successful: Jumper lands safely and remains in queue. - If clear fails (contact occurred): Jumper commits a fault, immediately becomes the new `Base`, the previous `Base` joins the jumping queue, and obstacle height resets to L=1. R3. **Level progression:** If all jumpers in the queue successfully clear level L, obstacle height advances to L←L+1. R4. [gap-fill] Grand clearing:** If all jumpers clear Level 5 (*Al-Mitr*), the jumpers each score 1 point, and the same `Base` must restart at Level 1. R5. [gap-fill] Match termination:** First jumper to accumulate 3 points (or survive 5 full cycles without becoming Base) wins the match. ## Edge cases - **Tie at the end condition:** Highest points; tiebreaker is fewest times designated as Base [gap-fill]. - **A player with no legal move:** Jumper must attempt the leap. - **Repetition / cycles:** Bounded by 20 level cycles maximum [gap-fill]. - **Simultaneous claims:** Not applicable — jumps are strictly sequential. - **Player elimination mid-round:** Dynamic queue resizing preserves order. - **Resource exhaustion:** Not applicable. - **Termination guarantee:** Provable termination via round cap. ## State representation - **Persistent state:** `base_id: AgentID`, `jumper_queue: List[AgentID]`, `points: Dict[AgentID, int]`. - **Ephemeral state:** `current_level: int \in [1,5]`, `current_jumper_index: int`. - **Observable information:** Fully observable state. ## Action space - `attempt_leap()`: Evaluates clearance probability for active jumper. ## Playability notes - **Single-player-vs-AI:** Operates as a progressive high-jump rhythm/reflex challenge. - **Group games (n>4):** Native queue structure scales from 3 to 10 players. - **Physical-skill games:** Physical vertical leap and flexibility mapped to level-dependent failure rates. - **What is lost:** Tactile hand-span adjustments, physical balance, and courtyard cheers. ## Implementation hints Very simple discrete state machine. State is an integer level counter and an array of agent IDs.

Download as JSON

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

Download JSON
Cite this page

Spanning and Meter (Palestine). (n.d.). Games of Countries. https://gamesofcountries.com/games/ps-palestine/shibr-wa-mitr

@misc{gamesofcountries-ps-palestine-shibr-wa-mitr,
  title = {Spanning and Meter (Palestine)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/ps-palestine/shibr-wa-mitr}
}