Formal Specification
Pigeon Flies (Bird Flies) — Formal Specification
Guernsey · dexterity-small · Confidence: medium
← Back to game pageImplementation Suitability
Suitability: engine-readyFidelity: probabilistic-proxyGap-fills: 2
# Pigeon Vole — AI-optimized specification
## General idea
A fast-paced stimulus-response and inhibition control game. A Caller agent announces prompt pairs at rapid intervals while consistently executing a deceptive physical action (raising finger). Respondent agents must inhibit visual mimicry and select actions based solely on the true semantic flight property of the named entity: raising their finger if and only if the entity is capable of flight.
## Formal model
- **Abstraction taken:** Semantic knowledge is formalized as a public ontology dictionary . Reaction timing and cognitive inhibition are modeled as discrete decision windows where agent error probability is influenced by the visual distractor.
- **Player/agent count:** 1 `CALLER` agent, and `RESPONDENT` agents (indexed ).
- **Turn model:** Synchronous round ticks. The Caller broadcasts a prompt; all active Respondents submit binary actions within a fixed time window.
## Formal rules
R1. Knowledge Base and Entities:
- Finite set of entities , where .
- Ground truth: if , and if .
R2. Round Loop:
- At tick , Caller samples an entity and broadcasts the event .
R3. Respondent Action:
- Each active Respondent declares action within time window .
R4. Error Evaluation and Elimination:
- Correct action: if , and if .
- For each active Respondent :
- If or response time : Respondent commits an error.
- In elimination mode: Respondent is eliminated (`OUT`).
R5. Win Condition:
- The round sequence continues until exactly 1 active Respondent remains, who is declared the winner (`SURVIVOR`).
- [gap-fill] Tie-break on mutual elimination: If all remaining active Respondents commit an error on the exact same tick, all those players are reinstated for a sudden-death round.
R6. [gap-fill] Max Round Horizon: If Respondent survives after prompts, the winner is the agent with the lowest average reaction latency across all correct responses.
## Edge cases
- Tie at the end condition: Resolved via R5/R6 (reinstatement or lowest average latency).
- A player with no legal move: Not applicable; Respondents always have exactly two binary choices ( or ).
- Repetition / cycles (and the loop-breaking rule): Bounded by the prompt horizon .
- Simultaneous claims on the same resource or position: Not applicable; all Respondent actions are evaluated independently against ground truth .
- Player elimination mid-round; turn order repair: Eliminated Respondents transition to `OUT` and submit no further actions.
- Resource exhaustion (pieces, tokens, space, time): Entity dictionary is finite; ticks are bounded by .
- Termination guarantee: Because each prompt has non-zero error rate under cognitive speed pressure, and the prompt sequence is hard-capped at , termination is strictly guaranteed.
## State representation
- Persistent state:
- `tick`: Integer counter .
- `active_players`: Set of active Respondent IDs .
- `reaction_latencies`: Matrix storing response times for active agents.
- Ephemeral state (per prompt):
- `current_entity`: String / token .
- `ground_truth`: Binary .
- `declared_responses`: Map of agent ID .
- Observable information: Fully observable public game state; current entity prompt and player statuses are public.
## Action space
- Caller: `broadcast_prompt(entity)` where .
- Respondent : `submit_response(action, latency)` where and .
## Playability notes
- Single-player-vs-AI: Very engaging reaction-time mini-game; human vs AI with simulated Stroop-effect cognitive delay.
- Group games (n>4): Scales naturally to any without rules adaptation.
- Physical-skill games: Cognitive reaction speed and inhibitory control are parameterized via an agent reaction distribution: and an inhibition failure probability on non-flying entities: .
- What is lost in the adaptation: Visual peripheral distraction, live table-tapping cadence, and comedic social pressure.
## Implementation hints
- Simple and lightweight state machine: array of boolean flight mappings .
- Can easily be integrated as a fast mini-game within a broader Channel Island folk collection suite.
- First milestone: Implement prompt broadcaster and deterministic correctness checker before adding latency metrics.
Download as JSON
Download the full game corpus entry for this game as structured JSON.
Download JSONCite this page
Pigeon Flies (Bird Flies) (Guernsey). (n.d.). Games of Countries. https://gamesofcountries.com/games/gg-guernsey/pigeon-vole
@misc{gamesofcountries-gg-guernsey-pigeon-vole,
title = {Pigeon Flies (Bird Flies) (Guernsey)},
year = {n.d.},
publisher = {Games of Countries},
url = {https://gamesofcountries.com/games/gg-guernsey/pigeon-vole}
}