Skip to main content
Formal Specification

The Shoemaker — Formal Specification

Estonia · chase-tag · Confidence: medium

← Back to game page

Implementation Suitability

Suitability: adaptation-requiredFidelity: discretizedGap-fills: 8
# Kingsepp (The Shoemaker) — AI-optimized specification ## General idea A dynamic spatial territory-swapping and deception game played across discrete home bases. A homeless seeker (the shoemaker) queries base occupants; players either misdirect the seeker to covertly swap bases behind their back or trigger a universal scramble where every occupant must abandon their base simultaneously, leaving the slowest agent without a home. ## Formal model - **Abstraction taken:** The open yard with drawn circles is modeled as a 2D topological graph with N discrete base nodes B={b1,…,bN} and connecting transit pathways. Sprinting and physical obstruction are modeled as simultaneous movement ticks with velocity parameters. - **Player/agent count:** 1 Shoemaker agent (S) and N Base Occupant agents (P1…PN). Total agents =N+1; total bases =N. - **Turn model:** Hybrid: Turn-based conversational query phase followed by real-time tick-based simultaneous sprint scramble. ## Formal rules R1. Setup: - N base nodes B1…BN are distributed across the field at mutual distance d(Bi,Bj)≥Dmin. - Each Occupant Pi starts inside a unique base Bi. - The Shoemaker S starts at center coordinates (0,0) with status `HOMELESS`. R2. Query Phase: - S approaches an occupant Pk at base Bk and submits `query_shoemaker(P_k)`. - Pk must immediately submit one of two responses: 1. `RESPOND_ABSENT(direction)` ("Ei ole kodus"): Pk designates a directional vector v→distract. 2. `RESPOND_HOME()` ("On kodus!"): Pk triggers an immediate universal scramble. R3. Resolution of `RESPOND_ABSENT`: - S is forced to move along v→distract for Twalk ticks [gap-fill: parameterized as Twalk=5 ticks]. - During Twalk, any pair of occupants (Pi,Pj) may submit `swap_bases(B_i, B_j)` and sprint between bases. - S has a detection radius Rrear; if a swap occurs within vision, S can break walking lock and attempt to reach an empty base. R4. Resolution of `RESPOND_HOME` (Universal Scramble): - All N occupants are immediately evicted from their current bases (Bi←VACANT). - Rule of mandatory migration: An agent cannot re-occupy their immediately vacated base [gap-fill: Pi cannot choose Bi during a scramble unless no other base is reachable]. - All N+1 agents (S and all N occupants) sprint simultaneously toward any vacant base Bm at speed v. R5. Base Claiming Resolution: - When an agent reaches a vacant base Bm, they execute `claim_base(B_m)`. - If two agents reach Bm on the same tick, priority is resolved by distance traveled or lowest agent ID [gap-fill: tie resolved by lower ID]. - A claimed base is locked for the remainder of the scramble. R6. Round End and Role Transition: - The scramble phase ends when all N bases are claimed (N agents safe). - Exactly 1 agent remains stranded without a base; this agent becomes the Shoemaker S for the subsequent round. - [gap-fill: A session completes after Rmax=10 rounds, scoring agents by fewest rounds spent as the Shoemaker]. ## Edge cases - Tie at the end condition: If two agents claim the final available base on the exact same tick, priority is broken by agent index per R5 [gap-fill: deterministic base conflict tiebreaker]. - A player with no legal move: Not applicable; agents always have valid target bases or movement coordinates. - Repetition / cycles: Bounded by the finite round limit Rmax [gap-fill: round cap bounding]. - Simultaneous claims on the same resource or position: Handled via distance-to-base and agent ID priority in R5. - Player elimination mid-round; turn order repair: If an agent disconnects, one base BN is removed from the environment, maintaining the strict invariant of |Bases|=|Agents|−1 [gap-fill: dynamic base removal]. - Resource exhaustion: Not applicable; bases are non-depleting spatial positions. - Termination guarantee: Each scramble strictly terminates in at most ⌈Dmax/v⌉ ticks since N+1 agents compete for N static targets; total game terminates at Rmax [gap-fill: termination guarantee via bounded scramble ticks and round cap]. ## State representation - Persistent state: - `bases`: Array of N coordinate positions and occupancy status (`VACANT` or Occupant ID). - `shoemaker_id`: Agent ID currently in the Shoemaker role. - `rounds_as_shoemaker`: Map of Agent ID → Integer count. - `current_round`: Integer r∈[1,Rmax]. - Per-tick ephemeral state: - `agent_positions`: Map of Agent ID →(x,y). - `movement_locks`: Active walk/distraction timer on Shoemaker. - `scramble_active`: Boolean flag indicating active universal sprint. - Observable information: Positions of all bases and agents are public; occupant swap intentions are private until movement begins. ## Action space - `query_shoemaker(target_id)`: (Shoemaker) Initiate dialogue with base occupant. - `respond(type, direction)`: (Occupant) Return `RESPOND_ABSENT` or `RESPOND_HOME`. - `initiate_swap(partner_id)`: (Occupant) Send swap proposal to peer. - `sprint_to(target_base)`: (All agents) Move toward target base at maximum speed v. - `claim_base(base_id)`: (All agents) Lock occupancy of current base. ## Playability notes - Single-player-vs-AI: Highly engaging. Single human occupant coordinating AI peer swaps and reading AI shoemaker positioning, or human shoemaker exploiting visual angles to steal bases. - Group games (n>4): Reduces to 1 Shoemaker vs 2 Occupants (2 bases). A 1v1 reduction (1 base, 2 players) degenerates into a trivial two-player footrace; minimum viable player count is 3. - Physical-skill games: Physical reaction speed and sprinting are modeled via velocity vectors and graph shortest paths. - What is lost in the adaptation: Eye-contact micro-signaling between peers across the yard and the sudden physical collision chaos of a group scramble. ## Implementation hints Model bases as nodes on a regular polygon (e.g. pentagon/hexagon) around a central origin. First milestone: Implement the universal scramble (R4-R6) with greedy pathfinding before implementing the distraction and bilateral swap logic (R3).

Download as JSON

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

Download JSON
Cite this page

The Shoemaker (Estonia). (n.d.). Games of Countries. https://gamesofcountries.com/games/ee-estonia/kingsepp

@misc{gamesofcountries-ee-estonia-kingsepp,
  title = {The Shoemaker (Estonia)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/ee-estonia/kingsepp}
}