Skip to main content
Formal Specification

Little Boxes, Move! (Puss in the Corner) — Formal Specification

Czechia · chase-tag · Confidence: high

← Back to game page

Implementation Suitability

Suitability: engine-readyFidelity: discretizedGap-fills: 2
# Škatulata, hejbejte se! — AI-optimized specification ## General idea A simultaneous spatial displacement game on a discrete network graph where N agents compete to occupy N−1 base nodes upon a trigger signal. Agents must vacate their current node and sprint to a different node, with the unseated agent becoming the central caller for the next round. ## Formal model - **Abstraction taken:** The 2D play space is modeled as a circular graph G=(V,E) with N−1 perimeter base nodes Vbase={1,2,…,N−1} and one central node Vcenter={0}. Euclidean distance d(u,v) governs transit time between nodes. - **Player/agent count:** N agents (A1..AN, standard N=5). - **Turn model:** Two-step cycle: Synchronous Trigger → Simultaneous Target Selection and Routing. ## Formal rules R1. Setup: N−1 base nodes arranged symmetrically on a circle of radius R=5.0 m centered at (0,0). Center node is at (0,0). N−1 agents each occupy one base node; Agent Acaller occupies the center node. R2. Call Trigger: Acaller emits the signal `HEJBEJTE_SE`. R3. Target Commitment: - Every base-occupying agent i MUST select a target node Ti∈Vbase∖{current_nodei}. - Center agent Acaller selects any target node TC∈Vbase. R4. Travel Time Resolution: - Travel time for agent i to reach Ti is ti=d(current_nodei,Ti)vi+ϵi, where vi∈[3.0,5.0] is sprint velocity and ϵi∼𝒩(0,0.052) is execution latency. R5. Node Occupation & Claiming: - For each base node k∈Vbase, the agent with the minimum arrival time tmin(k)=mini∈Claimants(k)⁡ti is awarded ownership of node k. - Defeated claimants for node k are unseated. R6. [gap-fill] Secondary Fallback: If an agent is unseated at their primary target Ti, they immediately route to any remaining unoccupied base node kopen with additional latency proportional to distance. R7. Round Outcome: Exactly one agent fails to secure any base node. That agent is designated Acaller for the subsequent round. R8. [gap-fill] Multi-round Tournament Termination: In elimination mode, the unseated agent after each round is permanently removed, and one base node is deleted. The game concludes when 2 agents compete for 1 base; the winner of the final base is declared tournament champion. ## Edge cases - Tie at the end condition: In 1v1 final, identical arrival times are broken by lowest initial agent ID. - A player with no legal move: Addressed by compulsory target choice Ti≠current_node. - Repetition / cycles: In non-elimination mode, match is capped at M=10 rounds; agent with fewest caller assignments wins. In elimination mode, rounds are strictly N−1. - Simultaneous claims on the same resource: Explicitly resolved by R5 minimum arrival timestamp. - Player elimination mid-round: Handled natively by elimination mode (base node removed, active agent count decremented). - Resource exhaustion: Node count equals agent count minus one at all stages. - Termination guarantee: Guaranteed by finite round count (N−1 in elimination, M in casual mode). ## State representation - Persistent state: `active_agents: list[int]`, `caller_id: int`, `node_positions: dict[int, tuple[float, float]]`, `caller_history: dict[int, int]`. - Ephemeral round state: `target_declarations: dict[int, int]`, `arrival_times: dict[int, float]`, `node_allocations: dict[int, int]`. - Observable information: Fully observable (all agent locations and node coordinates are public). ## Action space - `select_target_base(target_node_id: int)`: Target node constraint target_node_id∈Vbase and ≠current_node. ## Playability notes - Single-player-vs-AI: Natural; 1 human vs. N−1 AI bots selecting optimal base interception targets. - Group games (n>4): Scales cleanly to 10–20 agents on larger geometric rings. - Physical-skill games: Sprint speed and sudden direction changes are abstracted into velocity parameters and distance metrics. - What is lost: Physical shoulder jostling and deceptive eye-contact bluffing during base selection. ## Implementation hints Low complexity. The core is an N-to-(N−1) bipartite matching problem resolved by shortest transit time. First milestone: 5 agents on a 4-node ring with simultaneous target selection and deterministic distance ties.

Download as JSON

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

Download JSON
Cite this page

Little Boxes, Move! (Puss in the Corner) (Czechia). (n.d.). Games of Countries. https://gamesofcountries.com/games/cz-czechia/skatulata-hejbejte-se

@misc{gamesofcountries-cz-czechia-skatulata-hejbejte-se,
  title = {Little Boxes, Move! (Puss in the Corner) (Czechia)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/cz-czechia/skatulata-hejbejte-se}
}