Formal Specification
King, King, Give Me a Soldier (Polish Chain Charge & Capture) — Formal Specification
Poland · strength-endurance · Confidence: low
← Back to game pageImplementation Suitability
Suitability: adaptation-requiredFidelity: probabilistic-proxyGap-fills: 0
# Królu, królu, daj wojaka — AI-optimized specification
## General idea
An adversarial multi-agent team attrition game. Two teams alternate selecting an opposing runner to charge their defensive chain. The charging agent selects an intended breach point (a link between two specific defenders); a stochastic physical contest evaluates sprint momentum against combined grip resistance to transfer an agent from the losing side to the winning team.
## Formal model
- **Abstraction taken:** The continuous physical collision between the charging runner and the human chain is abstracted into a scalar kinetic contest: . Team rosters are represented as ordered lists of agents forming linear chains.
- **Player/agent count:** Total agents partitioned into Team A () and Team B ().
- **Turn model:** Strictly alternating rounds: (1) Calling team nominates target runner, (2) Runner selects target link in opposing chain, (3) Stochastic resolution and roster transfer.
## Formal rules
R1. **Setup:** Agents initialized with scalar attributes: , , . Team A holds ; Team B holds . Team A calls first.
R2. **Runner nomination:** The calling team (say, Team A) executes `nominate_runner(target_agent_id \in B)`.
R3. **Target link selection:** The nominated runner chooses a link between two adjacent agents in Team A's chain via `target_link(j)`.
R4. **Kinetic contest resolution:**
- Runner kinetic power: .
- Defensive chain resistance: , where is a coupling constant.
- Break probability: , where is the logistic sigmoid and is a temperature parameter.
R5. **State transition & player transfer:**
- If break succeeds ():
- Team B captures one of the two parted defenders (the one with lower grip strength, say ).
- ; .
- If break fails ():
- Team A captures runner .
- ; .
R6. **Role alternation:** Calling role swaps to the other team for the next round.
R7. **Victory condition:** When a team is reduced to player, the match terminates, and the opposing team with players wins.
## Edge cases
- **Tie at the end condition:** Not applicable; total player pool is conserved, and transfers strictly shift agents between sets until .
- **A player with no legal move:** When , the team has no legal chain links and is declared defeated.
- **Repetition / cycles:** Although players can transfer back and forth, the stochastic Markov chain on team sizes has absorbing states at 1 and 11 and reaches an absorbing boundary with probability 1 in finite expected turns.
- **Simultaneous claims on the same resource or position:** Turns and nomination choices are strictly sequential.
- **Player elimination mid-round; turn order repair:** Roster transfers dynamically resize team link arrays at the end of each round.
- **Resource exhaustion:** Total player count is strictly conserved.
- **Termination guarantee:** Guaranteed by the positive probability of absorption in the finite-state asymmetric random walk over team size .
## State representation
- **Persistent state:** `team_A_roster` (List[AgentId]), `team_B_roster` (List[AgentId]), `calling_team` (Enum[A, B]), `round_number` (Int).
- **Per-round ephemeral state:** `nominated_runner_id` (AgentId), `target_link_index` (Int), `break_success` (Bool).
- **Observable information:** Fully observable state; all agent physical attributes, team rosters, and link compositions are public.
## Action space
- `nominate_runner(target_agent_id: AgentId)`: Calling team selects opponent to sprint.
- `target_link(link_index: Int)`: Runner selects which pair of adjacent defenders to impact.
## Playability notes
- **Single-player-vs-AI:** Natural as a high-level strategic team management game (human captain selecting which enemy runner to challenge and which chain link to target).
- **Group games (n>4):** Reduces cleanly to a 2-macro-agent duel (Captain A vs. Captain B).
- **Physical-skill games:** Sprint acceleration, mass, and grip strength modeled via explicit physical equations feeding the logistic sigmoid contest resolver.
- **What is lost:** Real-time tactile hand-grip friction, shoulder impact deceleration, and tactical swerves during the sprint.
## Implementation hints
Extremely simple and robust state machine. State is just two integer lists. First milestone: implement the logistic transfer resolver and simulate the distribution of game lengths over 1,000 matches to calibrate the temperature parameter .
Download as JSON
Download the full game corpus entry for this game as structured JSON.
Download JSONCite this page
King, King, Give Me a Soldier (Polish Chain Charge & Capture) (Poland). (n.d.). Games of Countries. https://gamesofcountries.com/games/pl-poland/krolu-krolu-daj-wojaka
@misc{gamesofcountries-pl-poland-krolu-krolu-daj-wojaka,
title = {King, King, Give Me a Soldier (Polish Chain Charge & Capture) (Poland)},
year = {n.d.},
publisher = {Games of Countries},
url = {https://gamesofcountries.com/games/pl-poland/krolu-krolu-daj-wojaka}
}