Formal Specification
Little Boxes, Move! (Puss in the Corner) — Formal Specification
Czechia · chase-tag · Confidence: high
← Back to game pageImplementation 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 agents compete to occupy 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 with perimeter base nodes and one central node . Euclidean distance governs transit time between nodes.
- **Player/agent count:** agents (, standard ).
- **Turn model:** Two-step cycle: Synchronous Trigger Simultaneous Target Selection and Routing.
## Formal rules
R1. Setup: base nodes arranged symmetrically on a circle of radius m centered at . Center node is at . agents each occupy one base node; Agent occupies the center node.
R2. Call Trigger: emits the signal `HEJBEJTE_SE`.
R3. Target Commitment:
- Every base-occupying agent MUST select a target node .
- Center agent selects any target node .
R4. Travel Time Resolution:
- Travel time for agent to reach is , where is sprint velocity and is execution latency.
R5. Node Occupation & Claiming:
- For each base node , the agent with the minimum arrival time is awarded ownership of node .
- Defeated claimants for node are unseated.
R6. [gap-fill] Secondary Fallback: If an agent is unseated at their primary target , they immediately route to any remaining unoccupied base node with additional latency proportional to distance.
R7. Round Outcome: Exactly one agent fails to secure any base node. That agent is designated 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 .
- Repetition / cycles: In non-elimination mode, match is capped at rounds; agent with fewest caller assignments wins. In elimination mode, rounds are strictly .
- 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 ( in elimination, 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 and .
## Playability notes
- Single-player-vs-AI: Natural; 1 human vs. 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 -to- 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 JSONCite 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}
}