Skip to main content
Formal Specification

The Golden Gate — Formal Specification

Slovakia · singing-circle · Confidence: low

← Back to game page

Implementation 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 Tdrop=16 (the final beat of the 4-measure song [gap-fill]). The captured agent makes a binary choice between hidden team tokens A and B. When the queue is empty, a deterministic tug-of-war calculates net pulling force ∑FA−∑FB. - **Player/agent count:** 2 Gatekeepers (G1, G2), N Processioners (N∈[4,20]). - **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 A (e.g. Gold) and Gatekeeper 2 takes Token B (e.g. Silver). - N processioners are ordered in a linear queue Q=[p1,p2,…,pN]. - Team rosters TA={G1}, TB={G2}. R2. Procession Cycle: - Song duration is 16 beats. At each beat t∈[1,16], queue Q shifts forward by 1 position. - Each processioner has a pacing parameter si∈{0,1} (shuffle vs step [gap-fill]). - At beat 16, the agent currently located at index 0 (under the arch) is designated as captured (ptrap). R3. Team Selection: - ptrap is removed from Q. - Gatekeepers present the choices {A,B} to ptrap without revealing which gatekeeper owns which token. - ptrap submits a secret choice c∈{A,B}. - If c==A, ptrap is appended to team TA; if c==B, appended to team TB. R4. Loop Condition: Steps R2–R3 repeat until |Q|==0. R5. Phase 2 (Tug-of-War): - Each agent i has an intrinsic strength attribute Si∼𝒰(10,20) [gap-fill]. - Total team forces: FA=∑i∈TASi, FB=∑i∈TBSi. - Net force ΔF=FA−FB. R6. Win condition: If ΔF>0, Team A wins; if ΔF<0, Team B wins; if ΔF==0, the contest is a tie. ## Edge cases - Tie at the end condition: If FA==FB, 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 |Q| by exactly 1; exactly N 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 N iterations. - Termination guarantee: Deterministic progress parameter |Q| strictly decreases on each cycle, guaranteeing Phase 1 termination in N 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 s∈{0,1}. - `choose_token(token: str)`: Binary choice c∈{A,B} 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 N 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 JSON
Cite 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}
}