Skip to main content
Formal Specification

Spread Your Wings, Pigeon — Formal Specification

Jordan · singing-circle · Confidence: low

← Back to game page

Implementation Suitability

Suitability: engine-readyFidelity: directGap-fills: 1
# Farrish Ya Hamam — AI-optimized specification ## General idea A deterministic sitting-circle counting-out elimination game with light penalty choices. A leader recites a rhythmic 35-beat folk chant while sequentially tapping the outstretched hands of participants. The hand tapped on the final syllable receives a penalty and is eliminated from the circle until only one hand remains. ## Formal model - **Abstraction taken:** Musical chant modeled as an exact syllable count L=35. The circle is modeled as a circular list of active hand nodes. - **Player/agent count:** 3 to 10 children (each possessing 2 active hand tokens Hi,1,Hi,2). - **Turn model:** Sequential counting cycles executed by the Leader. ## Formal rules R1. **Initial state:** N players place both hands flat in the circle, creating a sequence of 2N active hand tokens in order H=[h1,h2,…,h2N]. Pointer starts at index 0. R2. **Chant execution:** The chant contains L=35 discrete beats. The pointer advances (L−1) steps: indextarget=(indexstart+L−1)(mod|H|) R3. **Penalty choice:** The owner of htarget selects between penalty modes: - Penalty∈{Daqqa (Tap),Mismar (Pinch)}. (Social choice; identical formal effect). R4. **Elimination:** htarget is removed from list H. Pointer indexstart for the next round is set to the immediately succeeding element in H. R5. [gap-fill] Player elimination:** A player is eliminated from the game when both of their hands are removed from H. R6. **Victory:** The game continues until |H|=1. The player who owns the final remaining hand wins the match. ## Edge cases - **Tie at the end condition:** Not applicable — hands are eliminated strictly one per cycle. - **A player with no legal move:** Selection of penalty is non-blocking (purely formal). - **Repetition / cycles:** Impossible since |H| strictly decreases by 1 on every iteration. - **Simultaneous claims:** Not applicable — circular counting is strictly sequential. - **Player elimination mid-round:** List H dynamic resizing preserves index ordering. - **Resource exhaustion:** Hand tokens are finite. - **Termination guarantee:** Provably terminates in exactly 2N−1 counting cycles. ## State representation - **Persistent state:** `active_hands: List[Tuple[PlayerID, int]]`, `player_scores: Dict[PlayerID, int]`. - **Ephemeral state:** `current_start_index: int`, `chant_length: int = 35`. - **Observable information:** Fully observable to all participants. ## Action space - `select_penalty(mode)`: Mode ∈{Tap,Pinch}. ## Playability notes - **Single-player-vs-AI:** Operates as a procedural Josephus-style counting puzzle where starting position determines outcome. - **Group games (n>4):** Native multi-agent procedure; zero loss in scaling. - **Physical-skill games:** Not applicable (purely procedural/social counting game). - **What is lost:** Rhythmic clapping, vocal cadence, and playful childhood anticipation. ## Implementation hints Direct implementation of circular array elimination (Josephus permutation). Minimal lines of logic.

Download as JSON

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

Download JSON
Cite this page

Spread Your Wings, Pigeon (Jordan). (n.d.). Games of Countries. https://gamesofcountries.com/games/jo-jordan/farrish-ya-hamam

@misc{gamesofcountries-jo-jordan-farrish-ya-hamam,
  title = {Spread Your Wings, Pigeon (Jordan)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/jo-jordan/farrish-ya-hamam}
}