Formal Specification
Sycamore People (Polish Arch Gate and Tug Game) — Formal Specification
Poland · singing-circle · Confidence: medium
← Back to game pageImplementation Suitability
Suitability: adaptation-requiredFidelity: discretizedGap-fills: 3
# Jaworowi ludzie — AI-optimized specification
## General idea
An asymmetric traditional Polish singing-procession and team-division game where a single-file train of agents passes beneath an arch formed by two gatekeepers. On rhythmic song cadences, the gate drops to capture passing agents, who make secret allegiance choices between two hidden factions before resolving the match in a culminating, cooperative physical tug-of-war contest.
## Formal model
- **Abstraction taken:** The physical loop procession is discretized into a 1D cyclic queue of agents advancing through a single gate cell `G`. The rhythmic singing cadence is modeled as a discrete song-timer `T` decremented on each step. The hidden item choice is modeled as a secret binary vote assigning agents to Team A or Team B. The concluding tug-of-war is modeled as a cumulative force-vector calculation parameterized by team member strength values and stochastic traction variance.
- **Player/agent count:** `N` agents (minimum 4, standard 6 to 16). Agents 0 and 1 are designated Gatekeeper A and Gatekeeper B; agents 2 to `N-1` form the Procession Line.
- **Turn model:** Two-phase structure: (1) Procession & Selection Phase (sequential stepped ticks until the procession queue is empty), followed by (2) Tug-of-War Resolution Phase (synchronous discrete force tug ticks).
## Formal rules
R1. **Setup:**
- Gatekeeper A and Gatekeeper B are assigned secret faction identifiers `F_A` ("Złote Jabłko") and `F_B` ("Srebrna Gruszka"). The correspondence between faction names and gatekeeper identities is hidden from all Procession Walkers.
- The remaining `N-2` agents are queued in a sequence `Q = [A_2, A_3, ..., A_{N-1}]`.
- Team rosters `Roster_A` and `Roster_B` are initialized: `Roster_A = [Gatekeeper_A]`, `Roster_B = [Gatekeeper_B]`.
R2. **Procession Step:**
- On each step, the head agent of `Q` moves into the Gate position `G`.
- The song counter `T` decrements by 1 (initialized to a fixed song length `L_song`, e.g., 3 to 6 steps per stanza).
R3. **Capture Trigger:**
- When `T == 0`, the gate drops: the agent currently located at `G` is captured.
- The captured agent is removed from `Q`.
- `T` is reset to `L_song`.
R4. **Secret Choice & Alignment:**
- The captured agent selects an action `choose_allegiance(choice)`, where `choice ∈ {"Złote Jabłko", "Srebrna Gruszka"}`.
- If `choice == "Złote Jabłko"`, the agent is appended to `Roster_A`; if `choice == "Srebrna Gruszka"`, the agent is appended to `Roster_B`.
- The chosen faction assignment is public to the team, but the opposing team observes only total roster counts.
R5. **Phase Transition:**
- Steps R2–R4 repeat until `Q` is empty. If the final agent passes through when `T > 0`, [gap-fill] the final agent is automatically captured on the last step.
R6. **Tug-of-War Phase:**
- The state tracks a 1D balance marker `X` initialized to `0.0` (center line). Boundary thresholds are `+D_win` (Team A win) and `-D_win` (Team B win).
- On each tug tick `k`, each team computes collective pulling force:
`Force_A = Sum_{i in Roster_A} (Strength_i + Noise_i)`
`Force_B = Sum_{j in Roster_B} (Strength_j + Noise_j)`
- Position updates: `X_{k+1} = X_k + (Force_A - Force_B) * dt`.
- If `X >= +D_win`, Team A wins immediately. If `X <= -D_win`, Team B wins immediately.
R7. [gap-fill] **Tug Turn Limit:** If neither team pulls the marker past the win threshold within `K_max = 20` tug ticks, the team with `X > 0` wins (or a draw if `X == 0.0`).
## Edge cases
- **Tie at the end condition:** In the tug-of-war phase, if `X == 0.0` after `K_max` ticks, [gap-fill] a sudden-death single-tick high-effort pull is executed; if still equal, the game is declared a draw.
- **A player with no legal move:** Procession walkers must advance when queued; captured agents have exactly two valid binary options ("Złote Jabłko" vs "Srebrna Gruszka"), ensuring a legal move always exists.
- **Repetition / cycles:** The procession queue strictly decreases by 1 agent per capture event until empty, preventing infinite loops in Phase 1; Phase 2 is bounded by `K_max` ticks.
- **Simultaneous claims on the same resource or position:** The queue `Q` is strictly ordered single-file; exactly one agent occupies the gate cell `G` at any tick.
- **Player elimination mid-round; turn order repair:** No elimination occurs; all players transition from the procession queue into one of the two active tug rosters.
- **Resource exhaustion:** Queue tokens are strictly conserved (`N` total agents partitioned into two subsets).
- **Termination guarantee:** Phase 1 provably terminates in at most `(N-2) * L_song` ticks; Phase 2 provably terminates in at most `K_max` ticks.
## State representation
- **Persistent state:** `phase` (PROCESSION | TUG_OF_WAR | TERMINATED), `gatekeeper_A_id`, `gatekeeper_B_id`, `roster_A` (List[AgentId]), `roster_B` (List[AgentId]), `pull_position_X` (Float), `winner_team` (Optional[TeamId]).
- **Per-tick ephemeral state:** `procession_queue` (List[AgentId]), `active_gate_agent` (Optional[AgentId]), `song_timer_T` (Int), `tug_tick_count` (Int).
- **Observable information:** Procession line order and total counts in rosters are public. The mapping between faction token names and Gatekeeper IDs is private knowledge held only by the two Gatekeepers until an agent is captured and queried.
## Action space
- `advance()`: Procession leader and queue advance by 1 step.
- `drop_gate()`: Gatekeepers close the arch (triggered automatically when `T == 0`).
- `choose_allegiance(faction_name: String)`: Captured agent selects one of the two secret token options.
- `pull_tug(effort: Float[0.0..1.0])`: Tug participant applies pulling effort during Phase 2 ticks.
## Playability notes
- **Single-player-vs-AI:** Natural — the human player can act as a Procession Walker making strategic team balance deductions, or as a Gatekeeper trying to recruit stronger allies through psychological framing.
- **Group games (n>4):** Standard configuration supports `N` independent agents. In a 2-agent reduction, Gatekeeper A and Gatekeeper B draft simulated agents via sequential blind bidding.
- **Physical-skill games:** Physical strength and endurance are modeled via agent attributes `Strength ~ Normal(mu, sigma)` and stamina degradation per tug tick.
- **What is lost in the adaptation:** The physical joy of choral singing, rhythmic collective stepping, and visceral whole-body pulling is abstracted into discrete queue transitions and stochastic numeric force vectors.
## Implementation hints
Extremely lightweight state machine. Phase 1 is a deterministic queue partitioner driven by a cyclic song clock and private binary inputs; Phase 2 is a bounded 1D physics tug loop. Suggested first milestone: implement the complete two-phase state machine with uniform random choices and strength scalars, verifying that `roster_A.length + roster_B.length == N`.
Download as JSON
Download the full game corpus entry for this game as structured JSON.
Download JSONCite this page
Sycamore People (Polish Arch Gate and Tug Game) (Poland). (n.d.). Games of Countries. https://gamesofcountries.com/games/pl-poland/jaworowi-ludzie
@misc{gamesofcountries-pl-poland-jaworowi-ludzie,
title = {Sycamore People (Polish Arch Gate and Tug Game) (Poland)},
year = {n.d.},
publisher = {Games of Countries},
url = {https://gamesofcountries.com/games/pl-poland/jaworowi-ludzie}
}