Formal Specification
The Golden Gate — Formal Specification
Slovakia · singing-circle · Confidence: low
← Back to game pageImplementation Suitability
Suitability: engine-readyFidelity: discretizedGap-fills: 4
# Zlatá brána — AI-optimized specification
## General idea
A two-phase hybrid game featuring a sequential timing-and-drafting phase where agents pass through an oscillating capture gate and select hidden allegiances, followed by a cooperative tug-of-war resolution where team strength sums determine the winning coalition.
## Formal model
- **Abstraction taken:** The continuous serpentine procession under the arch is modeled as a circular queue of agent IDs advancing one position per rhythmic beat. Gatekeepers drop the gate on beat (the final beat of the 4-measure song [gap-fill]). The captured agent makes a binary choice between hidden team tokens and . When the queue is empty, a deterministic tug-of-war calculates net pulling force .
- **Player/agent count:** 2 Gatekeepers (G1, G2), Processioners ().
- **Turn model:** Phase 1: Discrete sequential queue advancement per song cycle. Phase 2: Simultaneous single-resolution team contest.
## Formal rules
R1. Setup:
- Gatekeeper 1 secretly chooses Token (e.g. Gold) and Gatekeeper 2 takes Token (e.g. Silver).
- processioners are ordered in a linear queue .
- Team rosters , .
R2. Procession Cycle:
- Song duration is 16 beats. At each beat , queue shifts forward by 1 position.
- Each processioner has a pacing parameter (shuffle vs step [gap-fill]).
- At beat 16, the agent currently located at index (under the arch) is designated as captured ().
R3. Team Selection:
- is removed from .
- Gatekeepers present the choices to without revealing which gatekeeper owns which token.
- submits a secret choice .
- If , is appended to team ; if , appended to team .
R4. Loop Condition: Steps R2–R3 repeat until .
R5. Phase 2 (Tug-of-War):
- Each agent has an intrinsic strength attribute [gap-fill].
- Total team forces: , .
- Net force .
R6. Win condition: If , Team wins; if , Team wins; if , the contest is a tie.
## Edge cases
- Tie at the end condition: If , the contest is declared a draw [gap-fill].
- A player with no legal move: Not applicable; passing in queue is automatic and token choice is a mandatory binary selection.
- Repetition / cycles: Each song cycle strictly reduces by exactly 1; exactly cycles occur.
- Simultaneous claims on the same resource or position: The queue is strictly ordered; exactly one agent occupies index 0 at beat 16.
- Player elimination mid-round; turn order repair: Captured players are drafted into teams, not eliminated from the game; queue shifts cleanly.
- Resource exhaustion (pieces, tokens, space, time): Queue drains to zero in exactly iterations.
- Termination guarantee: Deterministic progress parameter strictly decreases on each cycle, guaranteeing Phase 1 termination in steps, followed by instantaneous Phase 2 evaluation.
## State representation
- Persistent state: `queue: list[int]`, `team_A: list[int]`, `team_B: list[int]`, `gatekeeper_tokens: dict[int, str]`, `agent_strengths: dict[int, float]`.
- Per-cycle ephemeral state: `current_beat: int (1..16)`, `trapped_agent_id: int`, `trapped_agent_choice: str`.
- Observable information: Queue order and current team counts are public. Token-to-gatekeeper mapping is hidden from processioners until final reveal.
## Action space
- `step_pace(stride: int)`: Processioner pacing action .
- `choose_token(token: str)`: Binary choice by the trapped agent.
## Playability notes
- Single-player-vs-AI: Human can play as a Processioner trying to time their steps to avoid being trapped early, or make strategic guesses on which gatekeeper holds the desired team token.
- Group games (n>4): Naturally supports 6 to 25 agents; scales linearly in computation.
- Physical-skill games: Physical rhythmic marching and chain-pulling are discretized into queue mechanics and attribute sums.
- What is lost in the adaptation: Vocal singing harmonies, bodily contact in the human chain, and physical laughter during the trap drop.
## Implementation hints
Very low complexity. The entire simulation runs in a straightforward two-stage script. First milestone: Verify queue drain in exactly rounds with unbiased binary drafting, followed by force evaluation.
Download as JSON
Download the full game corpus entry for this game as structured JSON.
Download JSONCite this page
The Golden Gate (Slovakia). (n.d.). Games of Countries. https://gamesofcountries.com/games/sk-slovakia/zlata-brana
@misc{gamesofcountries-sk-slovakia-zlata-brana,
title = {The Golden Gate (Slovakia)},
year = {n.d.},
publisher = {Games of Countries},
url = {https://gamesofcountries.com/games/sk-slovakia/zlata-brana}
}