Skip to main content
Formal Specification

Stealing Land / Territory Knife Game — Formal Specification

North Macedonia · dexterity-throw · Confidence: low

← Back to game page

Implementation Suitability

Suitability: engine-readyFidelity: probabilistic-proxyGap-fills: 3
# Крадење земја (Дропка) — AI-optimized specification ## General idea A turn-based geometric area-capture game played on a discretized circular territorial map. Players start with equal angular sectors of a circle. On their turn, an agent throws a pointed knife/peg into an adjacent rival's territory. A successful vertical stick allows the thrower to partition the territory along a chord through the landing coordinate and annex the adjacent sub-polygon, eliminating opponents whose land area shrinks below a critical threshold. ## Formal model - **Abstraction taken:** The continuous circular field D={(x,y)|x2+y2≤R2} is represented as a set of N disjoint polygonal sectors 𝒫1…𝒫N such that ⋃𝒫i=D. Knife throws are modeled as target coordinate selections (xt,yt)∈𝒫victim with sticking probability Pstick. Polygon partitioning is executed via standard 2D computational geometry clipping. - **Player/agent count:** N agents (N∈[2,6]). - **Turn model:** Sequential cyclic turn order, with bonus turns awarded upon successful annexation. ## Formal rules R1. **Initial Polygon Partition:** Circle of radius R=1.0 centered at (0,0) is partitioned into N equal angular sectors 𝒫i={(r,θ)|0≤r≤R,θ∈[2π(i−1)N,2πiN)}. Each agent i begins with Areai=πR2N and Activei=True. R2. **Throw Action:** Active agent i submits action `throw_knife(target_x, target_y)` targeting point (xt,yt) inside polygon 𝒫j of active opponent j≠i. R3. **Sticking Check:** The knife sticks upright with probability Pstick=0.70+θskill,i−0.10⋅d(i,(xt,yt)). - If the knife fails to stick (slips flat): Turn ends immediately and passes to (i(modN))+1. R4. **Partition & Annexation:** - If the knife sticks at point Pland=(xt,yt)∈𝒫j: - A line L passing through Pland along a designated angle α splits polygon 𝒫j into two disjoint sub-polygons 𝒫j,1 and 𝒫j,2. - Agent i annexes the sub-polygon 𝒫j,sub adjacent to 𝒫i: 𝒫i←𝒫i∪𝒫j,sub, and 𝒫j←𝒫j∖𝒫j,sub. - Agent i receives an immediate bonus throw. R5. **Elimination Threshold:** If an agent j's remaining territory area falls below threshold Area(𝒫j)<Amin=0.05⋅πR2: - Agent j cannot stand on one foot and is eliminated (Activej←False). - Agent j's remaining area is absorbed by the eliminator 𝒫i. R6. [gap-fill] Line Angle Generation:** The partitioning chord angle α is constructed perpendicular to the radial vector from the circle origin to Pland to ensure deterministic, balanced polygon splits. R7. [gap-fill] Bonus Throw Cap:** An agent may execute at most 3 consecutive successful annexation throws in a single turn before turn handover occurs. R8. **Win Condition:** The last remaining agent with Active=True (holding 100% of circle area) wins the game. ## Edge cases - Tie at the end condition: Not applicable; territorial area is conserved (∑Areai=πR2) and transferred strictly from victim to conqueror until 1 survivor remains. - A player with no legal move: Active agent always has legal target coordinates inside opponent polygons while ≥2 active players remain. - Repetition / cycles: Bounded; every successful annexation strictly transfers positive non-zero area (ΔArea>0), driving the victim monotonically toward Amin. - Simultaneous claims on the same resource or position: Turns are strictly sequential; polygon boundaries update atomically before the next action. - Player elimination mid-round; turn order repair: Eliminated agents are removed from active turn rotation list 𝒪. - Resource exhaustion: Total land area is strictly conserved. - Termination guarantee: [gap-fill] Monotonic area reduction past Amin ensures that all N−1 opponents are eventually eliminated. ## State representation - **Persistent state:** Number of players N, turn order 𝒪, current turn index. - **Per-player state:** 2D polygon vertex list 𝒫i, current land area Areai, `Active` status. - **Observable information:** Fully observable; all polygon vertices, areas, and landing points are public. ## Action space - `throw_knife(target_x, target_y)`: Target coordinate (x,y)∈ℝ2 must lie within an opponent's active polygon 𝒫j. ## Playability notes - Single-player-vs-AI: Natural; player aims coordinates on a 2D radial map against AI opponents calculating maximum area slices. - Group games (n>4): Natively supports 2 to 6 players on a multi-sectored circle. - Physical-skill games: Knife rotation, flip physics, and balance-on-one-foot standing are abstracted into geometric thresholds. - What is lost in the adaptation: The tactile sensation of flipping a steel pocketknife, carving fresh dirt lines, and balancing on one muddy sneaker. ## Implementation hints Medium complexity. Requires a standard 2D polygon boolean library (clipping a convex/concave polygon by a line). First milestone: implement R1–R5 for 2 players with a simple radial slice function and verify area transfer and elimination triggers.

Download as JSON

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

Download JSON
Cite this page

Stealing Land / Territory Knife Game (North Macedonia). (n.d.). Games of Countries. https://gamesofcountries.com/games/mk-north-macedonia/kradenje-zemja

@misc{gamesofcountries-mk-north-macedonia-kradenje-zemja,
  title = {Stealing Land / Territory Knife Game (North Macedonia)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/mk-north-macedonia/kradenje-zemja}
}