Formal Specification
Shaleel (Sudanese Moonlit Bone Search) — Formal Specification
Sudan · guessing-hidden · Confidence: medium
← Back to game pageImplementation Suitability
Suitability: engine-readyFidelity: discretizedGap-fills: 2
# Shaleel — AI-optimized specification
## General idea
A nocturnal spatial search and pursuit game on a 2D grid. A target bone token is hurled to a random hidden coordinate emitting a noisy acoustic landing cue. Agents search the partially observed grid to discover and pick up the bone, triggering an evasive sprint back to the home base while evading intercepting opponents.
## Formal model
- **Abstraction taken:** Nocturnal darkness is formalized as a bounded vision radius grid cells around each agent. Acoustic sound localization is modeled as a noisy vector bearing pointing toward the bone landing coordinate.
- **Player/agent count:** 2 competing searcher agents (extensible to ).
- **Turn model:** Synchronous discrete ticks (100ms per tick).
## Formal rules
R1. Arena: 2D grid . Home base . Both agents start at .
R2. Bone Launch: Bone is thrown to a hidden target where .
- Each agent receives a noisy acoustic landing cue: .
R3. Movement & Search (per tick):
- Both agents simultaneously move cell in Chebyshev distance (orthogonal or diagonal).
- If an agent's position satisfies and bone is `ON_GROUND`:
- Agent executes `PICK_UP()`: agent becomes `CARRIER`, bone status becomes `HELD`.
R4. Stealth & Sprint Phase:
- Carrier can choose to emit `BLUFF_SEARCH` (move at 0.5 speed, concealing carrier status) or `SPRINT_BASE` (move at 1.0 speed toward ).
- If opponent is within vision radius of a sprinting carrier, carrier status is revealed as `SPOTTED`.
R5. Interception & Scoring:
- If Carrier reaches safely: Carrier wins round (**+10 points**).
- If Opponent occupies same cell as Carrier before Carrier reaches : Opponent executes `TACKLE_TAG()`: bone transfers to Opponent (Opponent becomes new Carrier).
R6. [gap-fill] Time Limit: Maximum 100 ticks per round. If bone is not brought to base by tick 100, round ends with 0 points.
R7. [gap-fill] Match Structure: Match consists of 5 rounds. Highest total score wins.
## Edge cases
- Tie at the end condition: If both agents have equal scores after 5 rounds, 1 sudden-death search round is played.
- A player with no legal move: Directional movement on open grid is always legal.
- Repetition / cycles: Bounded by the 100-tick hard round limit (R6).
- Simultaneous claims on the same resource or position: Simultaneous arrival at bone coordinate gives carrier status to the agent with higher agility attribute.
- Player elimination mid-round; turn order repair: Bone possession flips dynamically on tackle without eliminating agents.
- Resource exhaustion (pieces, tokens, space, time): Exactly 1 bone in play; 100 ticks per round.
- Termination guarantee: Guaranteed by the 100-tick cutoff.
## State representation
- Persistent state: `match_scores`: `{AGENT_A: int, AGENT_B: int}`, `round_number: int in 1..5`.
- Per-round state:
- `bone_pos`: `(x, y)`.
- `bone_status`: `ON_GROUND | HELD`.
- `carrier_id`: `NONE | AGENT_A | AGENT_B`.
- `pos_A`: `(x, y)`.
- `pos_B`: `(x, y)`.
- `tick_counter`: integer in `0..100`.
- Observable information: Home base is public. Bone position is hidden until within vision radius . Opponent position is visible only within line-of-sight.
## Action space
- `move(dx, dy)`: `dx, dy ∈ {-1, 0, 1}`.
- `pick_up()`: claim bone if within distance .
- `tackle_tag()`: seize bone from opponent if on same cell.
## Playability notes
- Single-player-vs-AI: Engine-ready; play as searcher navigating partial observability and sprint interception vs AI.
- Group games (n>4): Generalizes to agents competing in free-for-all or 2-team relay scrimmage.
- Physical-skill games: Night vision and acoustic pitch direction are mapped into vision radii and Gaussian noise vectors.
- What is lost in adaptation: The physical darkness of a village night, foot scrapes in sand, and antiphonal singing.
## Implementation hints
2D grid search simulator with partial visibility fog-of-war. First milestone: implement random bone drop, acoustic cue vector generation, and carrier base-return logic.
Download as JSON
Download the full game corpus entry for this game as structured JSON.
Download JSONCite this page
Shaleel (Sudanese Moonlit Bone Search) (Sudan). (n.d.). Games of Countries. https://gamesofcountries.com/games/sd-sudan/shaleel
@misc{gamesofcountries-sd-sudan-shaleel,
title = {Shaleel (Sudanese Moonlit Bone Search) (Sudan)},
year = {n.d.},
publisher = {Games of Countries},
url = {https://gamesofcountries.com/games/sd-sudan/shaleel}
}