Formal Specification
Flowers, Girls or Boys (Romanian Category Deduction Game) — Formal Specification
Romania · guessing-hidden · Confidence: high
← Back to game pageImplementation Suitability
Suitability: engine-readyFidelity: directGap-fills: 2
# Flori, fete sau băieți — AI-optimized specification
## General idea
A discrete, sequential category deduction and team recruitment game. Two leaders secretly select items from a finite discrete category set . Queue agents sequentially submit candidate item guesses. Direct matches assign the guesser to that leader's team; misses incur minor penalty tokens and return the guesser to the queue until all agents are sorted into balanced factions.
## Formal model
- **Abstraction taken:** Cultural category domain (flowers, actors, cities) discretized into a finite dictionary of items ().
- **Player/agent count:** 2 Leaders () and Guessers (, default ).
- **Turn model:** Sequential queue processing with secret selection phases per guesser.
## Formal rules
R1. Setup:
- Finite category domain .
- Guesser queue .
- Team rosters .
R2. Secret Selection Phase:
- Leaders and secretly sample distinct secret items such that .
R3. Guess Submission Phase:
- Active guesser at head of queue submits guess .
R4. Match Resolution:
- If : Guesser is recruited to . Removed from .
- If : Guesser is recruited to . Removed from .
- If : Miss. Guesser receives 1 penalty token (`penalties += 1`) and rotates to the tail of .
R5. Faction Contest:
- Once (all guessers assigned):
- Teams and engage in a final scalar comparison:
R6. Win Condition:
- The team with higher final score wins.
R7. [gap-fill] Anti-Deadlock Cap: If a guesser misses 3 consecutive attempts, the leader with fewer team members automatically absorbs the guesser with a 2-point penalty to ensure queue termination.
## Edge cases
- Tie at the end condition: If final scores are equal, [gap-fill] a 1-round coin flip breaks the tie.
- A player with no legal move: Guesser must submit any item .
- Repetition / cycles: Bounded by R7 (maximum 3 misses per guesser guarantees queue clearance in at most steps).
- Simultaneous claims on the same resource or position: Leaders secretly pick distinct items by construction.
- Player elimination mid-round; turn order repair: Guessers exit queue upon successful match; queue shrinks monotonically.
- Resource exhaustion: Conserved agent count ().
- Termination guarantee: Enforced by R7 cap and non-zero probability of guessing or ().
## State representation
- Persistent state:
- `team_0`: List of agent IDs.
- `team_1`: List of agent IDs.
- `queue`: List of remaining guesser IDs.
- `penalties`: Array of integers.
- Per-step ephemeral state:
- `secret_items`: Tuple of hidden integers .
- `current_guess`: Integer .
- Observable information: Queue order, team memberships, and penalty counts are public. Secret items are private to the leaders until revealed upon matching.
## Action space
- Leaders: `choose_secret(item_id)`.
- Guesser: `submit_guess(item_id)`.
## Playability notes
- Single-player-vs-AI: Playable as a Bayesian dictionary-frequency search and deduction game.
- Group games (n>4): Easily supports guessers.
- Physical-skill games: Not applicable (discrete category matching).
- What is lost: Pop-culture trivia debates and romantic teasing of teenage bench culture.
## Implementation hints
- Simple queue state machine with discrete integer dictionary.
- AI guesser strategy: maintains probability distribution over based on past leader choices.
Download as JSON
Download the full game corpus entry for this game as structured JSON.
Download JSONCite this page
Flowers, Girls or Boys (Romanian Category Deduction Game) (Romania). (n.d.). Games of Countries. https://gamesofcountries.com/games/ro-romania/flori-fete-sau-baieti
@misc{gamesofcountries-ro-romania-flori-fete-sau-baieti,
title = {Flowers, Girls or Boys (Romanian Category Deduction Game) (Romania)},
year = {n.d.},
publisher = {Games of Countries},
url = {https://gamesofcountries.com/games/ro-romania/flori-fete-sau-baieti}
}