Skip to main content
Formal Specification

King, King, Give Me a Soldier (Polish Chain Charge & Capture) — Formal Specification

Poland · strength-endurance · Confidence: low

← Back to game page

Implementation 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: Mrunner(mass,sprint_speed)>Gpair(grip1+grip2)+ϵ. Team rosters are represented as ordered lists of agents forming linear chains. - **Player/agent count:** Total N=12 agents partitioned into Team A (|A|=6) and Team B (|B|=6). - **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: massi∈[40,80] kg, speedi∈[5,10] m/s, gripi∈[200,500] N. Team A holds A={a1,…,ak}; Team B holds B={b1,…,bm}. 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 b∈B chooses a link (aj,aj+1) between two adjacent agents in Team A's chain via `target_link(j)`. R4. **Kinetic contest resolution:** - Runner kinetic power: Erun=0.5⋅massb⋅speedb2. - Defensive chain resistance: Rchain=K⋅(gripaj+gripaj+1), where K is a coupling constant. - Break probability: Pbreak=σ(Erun−Rchainτ), where σ is the logistic sigmoid and τ is a temperature parameter. R5. **State transition & player transfer:** - If break succeeds (U≤Pbreak): - Team B captures one of the two parted defenders (the one with lower grip strength, say aj). - A←A∖{aj}; B←B∪{aj}. - If break fails (U>Pbreak): - Team A captures runner b. - B←B∖{b}; A←A∪{b}. R6. **Role alternation:** Calling role swaps to the other team for the next round. R7. **Victory condition:** When a team is reduced to |T|≤1 player, the match terminates, and the opposing team with ≥11 players wins. ## Edge cases - **Tie at the end condition:** Not applicable; total player pool N=12 is conserved, and transfers strictly shift agents between sets until |T|≤1. - **A player with no legal move:** When |T|=1, 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 {1..11} 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 Lteam=|T|−1 at the end of each round. - **Resource exhaustion:** Total player count N=12 is strictly conserved. - **Termination guarantee:** Guaranteed by the positive probability of absorption in the finite-state asymmetric random walk over team size |A|∈[1,11]. ## 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 JSON
Cite 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}
}