Skip to main content
Formal Specification

Bridge, Bridge, Glasses / The Bridge Game — Formal Specification

Denmark · singing-circle · Confidence: high

← Back to game page

Implementation Suitability

Suitability: adaptation-requiredFidelity: probabilistic-proxyGap-fills: 2
# Bro, bro, brille — AI-optimized specification ## General idea A ritual singing-procession and team-partitioning game followed by a physical tug-of-war. Agents march in single file beneath an archway formed by two bridge leaders while chanting a traditional verse; the agent under the bridge on the final cadence is trapped, makes a blind binary choice between two secret identities (Sun vs. Moon), and joins that leader's team. When all marchers have been partitioned into two squads, the teams resolve the match via a continuous isometric pulling contest. ## Formal model - **Abstraction taken:** The continuous physical walking loop is replaced by an indexed queue rotation advancing Lsong discrete steps per verse. Physical capture is indexed to the agent occupying the bridge position at step index Lsong. The concluding physical tug-of-war is abstracted into a stochastic strength aggregation contest P(Team A wins)=f(∑SA,∑SB). - **Player/agent count:** 6 to 30 agents (2 Leaders, M≥4 Marchers). - **Turn model:** Sequential procedural rounds for team selection; single simultaneous resolution for the concluding tug-of-war. ## Formal rules R1. **Role Setup:** Two agents are assigned as `Leader A` and `Leader B`. The remaining M agents form a single-file FIFO queue Q=⟨a1,a2,…,aM⟩. R2. **Secret Codename Allocation:** `Leader A` is secretly mapped to label λA∈{Sol,Måne}, and `Leader B` is mapped to λB={Sol,Måne}∖{λA}. This mapping is hidden from all marchers in Q. R3. **Marching Cycle:** On each verse round, the queue Q advances through the bridge node. The position of each agent advances by Lverse=28 steps modulo |Q|. R4. **Bridge Capture:** The agent atrapped positioned at the bridge node on step 28 is removed from Q. R5. [gap-fill] Secret Choice Action:** Agent atrapped submits an action `choose_allegiance(choice)` where `choice` ∈{Sol,Måne}. If `choice` ==λA, atrapped joins Team A; if `choice` ==λB, atrapped joins Team B. R6. **Loop Continuation:** R3–R5 repeat until Q is empty (|Q|=0). R7. **Tug-of-War Contest:** Each agent i possesses an intrinsic strength attribute Si∈ℝ+. Aggregate team strengths are computed as FA=∑i∈TASi+ϵA and FB=∑j∈TBSj+ϵB, where ϵA,ϵB∼𝒩(0,σ2). R8. **Win Condition:** If FA>FB, Team A wins; if FB>FA, Team B wins. R9. [gap-fill] Tug-of-War Tie-Break:** If |FA−FB|<10−4, a secondary sudden-death pull round is simulated with σtie=1.0 until a strictly positive difference is established. ## Edge cases - Tie at the end condition: Resolved by R9 (resimulating the stochastic force differential until |FA−FB|>0). - A player with no legal move: In the marching phase, movement is automatic. In the choice phase, `choose_allegiance` has exactly 2 legal options. In the tug-of-war phase, pulling is automatic. - Repetition / cycles: Strictly impossible; exactly one marcher is eliminated from queue Q on each verse round, guaranteeing the partitioning phase terminates in exactly M rounds. - Simultaneous claims on the same resource or position: The bridge arch has capacity 1; exactly one agent occupies the bridge coordinate at step index Lverse. - Player elimination mid-round; turn order repair: If an agent disconnects during the march, they are removed from Q and |Q| decrements. If a leader disconnects, the earliest assigned teammate is promoted to Leader. - Resource exhaustion (pieces, tokens, space, time): Not applicable; marchers are a finite set partitioned exhaustively into two disjoint subsets TA,TB. - Termination guarantee: why the game provably ends: Bounded by |Q| rounds (each strictly decreasing |Q| by 1), followed by a deterministic/stochastic force evaluation in R7–R9. ## State representation - **Persistent state:** Total player count N, agent roles, strength parameters {Si}i=1N, secret leader mapping (λA,λB), team rosters TA,TB. - **Per-round ephemeral state:** Current queue order Q, step counter k, trapped agent ID atrapped, choice submission. - **Observable information:** - Public: Queue order, identity of atrapped, size of teams |TA|,|TB|. - Hidden: Secret codename mapping (λA,λB) remains hidden from marchers until choice resolution; choice action is submitted in private. ## Action space - `march_step()`: Automatic environment step advancing the queue. - `choose_allegiance(choice)`: Parameter `choice` ∈{"Sol","Måne"}. Precondition: agent is atrapped. ## Playability notes - Single-player-vs-AI: Needs adaptation; human player participates as a marcher (making the blind choice) or as a leader (drafting a team), with AI handling queue stepping and opponent pulling attributes. - Group games (n>4): Can be reduced to 3 agents (2 Leaders + 1 Marcher who picks a side, creating a 2v1 pull), though traditional dynamics rely on large N to balance team sizes. - Physical-skill games: Tug-of-war is modeled as a scalar normal distribution over summed player physical capacities. - What is lost in the adaptation: Choral singing, the tension of ducking under moving arms, and physical tactile grip during the tug-of-war. ## Implementation hints Very low complexity. State transition graph is purely linear: M iterations of queue dequeue and team append, followed by a scalar comparison. First milestone: build the M-step team drafting loop and verify balanced random distribution across teams.

Download as JSON

Download the full game corpus entry for this game as structured JSON.

Download JSON
Cite this page

Bridge, Bridge, Glasses / The Bridge Game (Denmark). (n.d.). Games of Countries. https://gamesofcountries.com/games/dk-denmark/bro-bro-brille

@misc{gamesofcountries-dk-denmark-bro-bro-brille,
  title = {Bridge, Bridge, Glasses / The Bridge Game (Denmark)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/dk-denmark/bro-bro-brille}
}