Formal Specification
Honey, Honey, Honey (Várkörjáró Leánykérő) — Formal Specification
Hungary · singing-circle · Confidence: high
← Back to game pageImplementation Suitability
Suitability: adaptation-requiredFidelity: abstractedGap-fills: 2
# Méz, méz, méz — AI-optimized specification
## General idea
A ritual depleting-accumulating circle game where a mobile pacing agent executes rhythmic musical cycles around a closed perimeter of stationary agents, selecting one agent per cycle to transfer from the outer ring into an expanding concentric chain until all agents are integrated. While primarily a cultural-choreographic performance without a competitive zero-sum dilemma, its dynamic topology offers a clean formal multi-agent state transition model.
## Formal model
- **Abstraction taken:** Musical rhythm and singing pitch are represented by a discrete cycle timer `t_stanza` (duration = 8 musical bars / 8 ticks). Spatial topology is modeled as two disjoint ordered lists: `OuterCircle` and `SuitorChain`.
- **Player/agent count:** `M` total agents (1 Leader `L`, `M-1` Ring agents). Standard `M = 8`.
- **Turn model:** Synchronized stanza-based state updates (1 transfer action executed at the end of each 8-tick stanza).
## Formal rules
R1. Setup: `OuterCircle = [Agent_1, Agent_2, ..., Agent_{M-1}]` arranged in a closed loop. `SuitorChain = [Leader_L]`.
R2. Stanza Progress: State advances through 8 rhythmic ticks (`t = 1..8`).
- OuterCircle agents rotate index positions by +1 tick.
- SuitorChain agents rotate in opposite direction by -1 tick.
R3. Selection Action (at `t = 8`):
- Head of SuitorChain (`Leader_L`) executes `select_partner(target_agent_id)`.
- Legal targets: Any agent currently in `OuterCircle`.
- [gap-fill] Decision Policy: Leader selects agent based on preference heuristic (e.g. adjacent index, musical synchronization metric, or randomized fair rotation).
R4. Topology Transfer:
- Selected `target_agent` is removed from `OuterCircle`.
- `target_agent` is appended to `SuitorChain` (`SuitorChain.append(target_agent)`).
R5. Loop Continuation: If `len(OuterCircle) > 1`, stanza timer resets to `t = 1` and R2–R4 repeat.
R6. Terminal Condition:
- When `len(OuterCircle) == 1`: The final agent is transferred into `SuitorChain`.
- All `M` agents merge into a single grand circle `CombinedCircle = SuitorChain`.
- [gap-fill] Game concludes; the first agent selected in R4 becomes `Leader_L` for the subsequent round.
## Edge cases
- Tie at the end condition: Not applicable — non-competitive cooperative social protocol; no winner/loser distinction.
- A player with no legal move: Not applicable — Suitor always has at least 1 selectable candidate in `OuterCircle` until termination.
- Repetition / cycles: Strictly impossible — each stanza monotonically reduces `len(OuterCircle)` by exactly 1; terminates in exactly `M - 1` stanzas.
- Simultaneous claims on the same resource or position: Single leader makes the selection at `t = 8`; zero concurrent claim conflict.
- Player elimination mid-round: No agent is eliminated; agents simply transition membership between sets.
- Resource exhaustion (pieces, tokens, space, time): Fixed finite agent count `M` conserved at all times (`len(OuterCircle) + len(SuitorChain) == M`).
- Termination guarantee: Provably terminates in `(M - 1) * 8` ticks.
## State representation
- Persistent state: `round_number`, `next_leader_id`.
- Per-round state: `outer_circle_list`, `suitor_chain_list`, `stanza_tick (1..8)`, `stanza_count`.
- Observable information: Fully observable — all agents observe ring size, chain size, and current song bar.
## Action space
- `step_rhythm()`: Synchronous tick advancement.
- `select_partner(agent_id)`: Executed by suitor leader at `t = 8`.
## Playability notes
- Single-player-vs-AI: Unsuitable as a traditional competitive game; viable as a music-rhythm timing minigame (hit timing prompts while selecting partners).
- Group games (n>4): Functions as a deterministic coordination and choreography state-machine test.
- Physical-skill games: Purely musical and social.
- What is lost: The communal acoustic resonance of shared choral singing and physical hand-holding warmth.
## Implementation hints
Extremely simple discrete list manipulation. Suggested first milestone: implement R1–R6 as a lightweight Python or state-machine test verifying that `len(OuterCircle)` decreases from `M-1` to 0 and all agents are accounted for in `SuitorChain`.
Download as JSON
Download the full game corpus entry for this game as structured JSON.
Download JSONCite this page
Honey, Honey, Honey (Várkörjáró Leánykérő) (Hungary). (n.d.). Games of Countries. https://gamesofcountries.com/games/hu-hungary/mez-mez-mez
@misc{gamesofcountries-hu-hungary-mez-mez-mez,
title = {Honey, Honey, Honey (Várkörjáró Leánykérő) (Hungary)},
year = {n.d.},
publisher = {Games of Countries},
url = {https://gamesofcountries.com/games/hu-hungary/mez-mez-mez}
}