Skip to main content
Formal Specification

Flies, Flies! (Bird Flies) — Formal Specification

North Macedonia · riddle-word · Confidence: low

← Back to game page

Implementation Suitability

Suitability: engine-readyFidelity: directGap-fills: 5
# Лета, лета — AI-optimized specification ## General idea A fast-paced cognitive reaction and classification game. A central caller rapidly presents nouns paired with a visual raising feint. Agents must classify whether the noun can fly (Flyable=True) within a tight reaction window, lifting their finger if true and suppressing motor movement if false. ## Formal model - **Abstraction taken:** The physical chant and finger motions are formalized into discrete stimulus-response rounds. The vocabulary dictionary 𝒱 consists of labeled tuples (word,CanFly∈{0,1}). The caller presents a word and visual feint; agents submit binary actions RaiseFinger∈{0,1} subject to response time limits. - **Player/agent count:** 1 Caller (C) and M responding agents (P1…PM), M∈[2,10]. - **Turn model:** Simultaneous reaction phase per round. ## Formal rules R1. **Vocabulary Database:** Ground-truth vocabulary 𝒱={(wk,fk)}k=1K where fk∈{0,1} indicates true aerodynamic flight capability (e.g. `(sparrow, 1)`, `(airplane, 1)`, `(frog, 0)`, `(table, 0)`). R2. **Player State:** Each player agent i maintains Livesi=3 and Activei=True. R3. **Call Generation:** In round t, Caller C samples word (wt,ft)∼𝒱. The caller always presents visual cue Vcue=1 (raising hand). R4. **Player Action Submission:** Each active player i submits action ai∈{0,1} (StayDown=0,RaiseFinger=1) within reaction time window τ≤500 ms. R5. **Error & Elimination Resolution:** - If ai≠ft: Player i committed an error (either false positive on non-flying noun or false negative on flying noun). - Upon error: Livesi←Livesi−1. - If Livesi=0: Player i is eliminated (Activei←False). R6. [gap-fill] Ambiguous Entity Resolution:** Any contested biological edge cases (e.g. flying squirrel, penguin) are resolved strictly by the binary ground truth fk declared in 𝒱 at startup. R7. [gap-fill] Caller Non-Bias Constraint:** The caller must sample flying (f=1) and non-flying (f=0) nouns with balanced probability P(f=1)=0.50±0.10. R8. **Win Condition:** The last remaining active player with Lives>0 wins the match. If all remaining active players fault in the same round, the round is replayed. R9. [gap-fill] Maximum Rounds Cap:** A match concludes at Tmax=30 rounds; the player with the most remaining lives wins. ## Edge cases - Tie at the end condition: If multiple players survive at round 30 with equal lives, sudden-death single-life rounds are played [gap-fill]. - A player with no legal move: Binary actions {0,1} are always available. - Repetition / cycles: Bounded; life totals decrease monotonically upon errors, and the 30-round hard cap guarantees termination. - Simultaneous claims on the same resource or position: Actions are evaluated independently per agent against the ground truth ft. - Player elimination mid-round; turn order repair: Eliminated agents transition to spectator state; active agent set updates without disruption. - Resource exhaustion: Vocabulary set 𝒱 is sampled with replacement. - Termination guarantee: [gap-fill] Guaranteed by non-zero player error rates and the 30-round hard limit. ## State representation - **Persistent state:** Number of players M, vocabulary database 𝒱, life array {Livesi}, active status vector. - **Per-round ephemeral state:** Current sampled word (wt,ft), submitted actions {ai}, round counter t∈[1,30]. - **Observable information:** Word wt and caller feint Vcue are public. Submitted responses are private until simultaneous reveal. ## Action space - `react(raise_finger)`: Parameter `raise_finger` ∈{0,1}. Precondition: player is active. ## Playability notes - Single-player-vs-AI: Fast-paced cognitive reaction test against an AI caller with trick nouns and speed escalation. - Group games (n>4): Natively accommodates large groups (2..10 players) with simultaneous round evaluations. - Physical-skill games: Motor impulse inhibition (suppressing finger movement despite visual caller trickery) is modeled as a classification decision. - What is lost in the adaptation: The infectious children's giggles when someone accidentally claims that a tractor flies (*"трактор лета!"*). ## Implementation hints Extremely low complexity. Requires a dictionary of labeled words and a simple evaluation loop comparing ai==ft. First milestone: implement R1–R5 with a 20-word dictionary and verify elimination triggers.

Download as JSON

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

Download JSON
Cite this page

Flies, Flies! (Bird Flies) (North Macedonia). (n.d.). Games of Countries. https://gamesofcountries.com/games/mk-north-macedonia/leta-leta

@misc{gamesofcountries-mk-north-macedonia-leta-leta,
  title = {Flies, Flies! (Bird Flies) (North Macedonia)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/mk-north-macedonia/leta-leta}
}