Skip to main content
Formal Specification

Land conquest — Formal Specification

Finland · dexterity-throw · Confidence: high

← Back to game page

Implementation Suitability

Suitability: engine-readyFidelity: probabilistic-proxyGap-fills: 3
# Maanvalloitus — AI-optimized specification ## General idea A traditional outdoor territory-conquest and knife/stick throwing game played on sand. A circular arena is initially partitioned into equal pie-shaped national territories. On their turn, a player throws a sharpened stick or knife into an opponent's territory; if it sticks upright, the thrower leans over the boundary without setting foot in the opponent's land to carve out a new geometric border slice, absorbing that land into their own nation until all opponents are eliminated. ## Formal model - **Abstraction taken:** Continuous circular continuous planar geometry is modeled using 2D polygonal planar partitioning (Voronoi/polygon boolean clipping). Physical knife/stick sticking and human balance while drawing the cut line are abstracted into a stochastic success sampler conditioned on throw distance, target area size, and reach extension. - **Player/agent count:** N players (2≤N≤6). - **Turn model:** Sequential fixed round-robin rotation (P1→P2→⋯→PN). ## Formal rules R1. **Arena & Initial Partition:** - The arena is a 2D unit circle C centered at origin (0,0) with radius R. - C is partitioned into N equal angular sectors T1,…,TN of angle 2π/N, one per active player. R2. **Throw Attempt:** - The active player Pi selects a target point (x,y) inside an opponent's territory Tj (j≠i). - The throw outcome succeeds (stick penetrates ground upright) with probability: P(stick)=f(throw_distance,target_area_size,player_skill) - If the throw fails, the turn ends immediately with no change in territory. R3. **Boundary Cut & Annexation:** - Upon a successful stick throw at (x,y)∈Tj: - A boundary line is drawn connecting (x,y) to two points on the boundary of Tj. - The cut must be reachable: [gap-fill] The distance from the nearest point on Pi's existing territory boundary ∂Ti to (x,y) must not exceed maximum physical reach Lreach. - A balance check is evaluated: P(balance_success)=g(reach_distance/Lreach). - If balance check fails (player would have touched opponent ground), the cut is invalidated and no territory is transferred. - If balance check succeeds, the carved polygon slice S⊂Tj containing (x,y) is annexed: Ti←Ti∪S, Tj←Tj∖S. R4. **Player Elimination:** - A player Pj is eliminated from the game immediately if their remaining territory area Area(Tj) falls below a minimum standing threshold Amin⁡ (e.g. Amin⁡=0.05×Area(C)). - [gap-fill] When Pj is eliminated, any remaining remnant territory of Pj becomes "neutral wasteland" that any adjacent surviving player can annex on a single successful throw. R5. **Win Condition:** The game is won immediately when exactly one player remains un-eliminated, controlling all remaining active territory in the circle. ## Edge cases - **Tie at the end condition:** Not applicable — play is strictly sequential; eliminations occur one by one until a single winner remains. - **A player with no legal move:** If a player has legal territory, they always have a legal throw action targeting any non-eliminated opponent. - **Repetition / cycles:** [gap-fill] To guarantee termination against endless back-and-forth nibbling of small land slices, each annexation must capture at least a minimum fraction ΔAmin⁡=0.02×Area(C) or it is rounded up/down, and a global limit of Mmax⁡=100 turns is enforced (highest territory area wins if reached). - **Simultaneous claims on the same resource or position:** Not applicable — turns and cuts are strictly sequential. - **Player elimination mid-round; turn order repair:** When a player Pj is eliminated, they are removed from the active turn rotation list. The turn passes immediately to the next surviving player in the cyclic sequence (i+1)(modsurvivors). - **Resource exhaustion (pieces, tokens, space, time):** Total area of circle C is conserved (∑Area(Ti)=πR2). - **Termination guarantee: why the game provably ends:** Territories monotonically concentrate into larger contiguous shapes with every successful cut, players are eliminated when below Amin⁡, and Mmax⁡ provides a hard ceiling. ## State representation - **Persistent state:** Polygon list of current territories {T1,…,TN}; active status list ∈{alive,eliminated}; turn index; total turn counter. - **Per-turn ephemeral state:** Chosen target coordinate (x,y); stick penetration success boolean; reach feasibility boolean; balance success boolean; proposed cut polygon. - **Observable information:** Fully observable game state (territory boundaries and areas are common knowledge). ## Action space - `throw_and_cut(target_x, target_y, cut_angle)`: - `target_x, target_y`: continuous coordinate within an opponent's territory polygon. - `cut_angle`: angle of the dividing line passing through (targetx,targety). ## Playability notes - **Single-player-vs-AI:** Highly playable. Human plays against 1–3 AI bots that calculate optimal geometric cuts to maximize land capture and isolate opponents. - **Group games (n>4):** Reduces naturally to 2 agents (a duel across a circle split in half), which sharpens the mathematical and geometric risk/reward tension. - **Physical-skill games:** Stick throwing accuracy and physical leaning balance are abstracted into calibrated success probability functions. - **What is lost in the adaptation:** The physical thrill of flipping a sharp wooden stick or pocket knife into damp sand, and the physical gymnastics of balancing on one foot while scratching a line in the dirt. ## Implementation hints - Use standard 2D polygon boolean operations (e.g. Clipper2 / Shapely) to compute polygon difference (Tj∖S) and union (Ti∪S). - Branching factor: Continuous geometric choice space; can be discretized into candidate target grid points × candidate cut angles. - Suggested first milestone: Implement a 2-player circle divided by a single diameter line, verifying that a target point in territory 2 correctly generates a dividing cut that transfers area to player 1.

Download as JSON

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

Download JSON
Cite this page

Land conquest (Finland). (n.d.). Games of Countries. https://gamesofcountries.com/games/fi-finland/maanvalloitus

@misc{gamesofcountries-fi-finland-maanvalloitus,
  title = {Land conquest (Finland)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/fi-finland/maanvalloitus}
}