Skip to main content
Formal Specification

King, King, Give Us a Soldier — Formal Specification

Slovakia · strength-endurance · Confidence: low

← Back to game page

Implementation Suitability

Suitability: engine-readyFidelity: probabilistic-proxyGap-fills: 4
# Kráľu, kráľu, daj vojsko — AI-optimized specification ## General idea A strategic team-recruitment and link-breaking duel where two teams alternatingly summon an opposing runner to charge a specific joint in their defensive chain. Teams optimize their defensive lineup positioning while chargers evaluate kinetic momentum against weakest-link grip probabilities to assimilate the entire opposing roster. ## Formal model - **Abstraction taken:** Each agent i possesses a Strength attribute Si∈[1,10] and a Momentum attribute Mi∈[1,10]. A joint between defenders j and k has link resistance Rjk=Sj+Sk. A charge by agent i against link (j,k) succeeds with probability: P(break)=11+exp⁡(−Mi−Rjk+δτ) [gap-fill] δ=2.0 and temperature τ=2.0 calibrate fair turnover rates. - **Player/agent count:** 2 teams, initial size NA=NB=N∈[4,15]. Total agents 2N. - **Turn model:** Strictly alternating turn phases (Team A summons → resolution → Team B summons → resolution). ## Formal rules R1. Setup: Teams initialize rosters TA and TB of equal size N. Total players 2N. Max turns = 30 [gap-fill]. R2. Summons: The active attacking team chooses which opposing player c∈Tdef is summoned to charge. R3. Target Link Selection: The summoned runner c selects a target joint (j,k) in the defending team's ordered line, where j and k are adjacent defenders. R4. Breakthrough Resolution: The kinetic contest is resolved via P(break). - If breakthrough succeeds: Runner c captures one of the two defenders (e.g. arg⁡min⁡(Sj,Sk)) into their home team Tatt. - If breakthrough fails: Runner c is captured by the defending team and inserted into Tdef between j and k. R5. Team Lineup Reordering: Teams may rearrange their linear adjacency sequence before the next summons phase [gap-fill]. R6. Turn Swap: Active offensive role passes to the other team. R7. Win condition: The game terminates when either: - One team reaches |T|≤1 (all players captured except 1), OR - The 30-turn limit is reached, in which case the team with strictly more players wins. ## Edge cases - Tie at the end condition: If both teams have equal roster sizes at turn 30, 1 sudden-death charge round is resolved; higher probability roll decides the victor [gap-fill]. - A player with no legal move: As long as |T|≥2, a team always has valid joints (j,k) to defend and members to summon. - Repetition / cycles: The 30-turn cap strictly breaks any endless back-and-forth trading of players. - Simultaneous claims on the same resource or position: Turns and joint selections are strictly sequential. - Player elimination mid-round; turn order repair: Captured players immediately shift team array membership and update local team counts; no orphan pointers. - Resource exhaustion (pieces, tokens, space, time): The finite set of 2N agents is strictly conserved across team partitions (|TA|+|TB|=2N invariant). - Termination guarantee: Monotonic progress toward the 30-turn limit or an absorbing state (|TA|∈{0,2N}) guarantees termination. ## State representation - Persistent state: `turn: int`, `team_A: list[int]`, `team_B: list[int]`, `agent_strength: dict[int, float]`, `agent_momentum: dict[int, float]`. - Per-turn ephemeral state: `summoned_runner_id: int`, `target_joint: tuple[int, int]`, `breakthrough_success: bool`, `captured_player_id: int`. - Observable information: Fully observable — all agent attributes, team rosters, and line sequences are public knowledge. ## Action space - `summon_player(target_agent_id: int)`: Select target agent from opposing team. - `select_target_joint(left_defender_id: int, right_defender_id: int)`: Select adjacent pair of defenders to charge. - `reorder_lineup(ordered_id_list: list[int])`: Reorder the defensive chain. ## Playability notes - Single-player-vs-AI: Highly strategic; player manages team positioning and selects which opponent to summon to maximize capture probabilities. - Group games (n>4): Cleanly reduces to 2 controlling captain agents managing team rosters, or individual agents voting on summons and target joints. - Physical-skill games: Physical grip strength and running momentum are cleanly modeled as a logistic threshold resolver. - What is lost in the adaptation: Physical sensation of arm strain, impact jarring, and real-time sprint acceleration. ## Implementation hints Low complexity. The state space is simply two disjoint lists of player IDs with fixed attributes. Implement the logistic breakthrough probability function and roster migration logic first.

Download as JSON

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

Download JSON
Cite this page

King, King, Give Us a Soldier (Slovakia). (n.d.). Games of Countries. https://gamesofcountries.com/games/sk-slovakia/kralu-kralu-daj-vojsko

@misc{gamesofcountries-sk-slovakia-kralu-kralu-daj-vojsko,
  title = {King, King, Give Us a Soldier (Slovakia)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/sk-slovakia/kralu-kralu-daj-vojsko}
}