Skip to main content
Formal Specification

Squirrels and Trees (Vāverītes) — Formal Specification

Latvia · chase-tag · Confidence: low

← Back to game page

Implementation Suitability

Suitability: engine-readyFidelity: discretizedGap-fills: 6
# Vāveres un koki — AI-optimized specification ## General idea A spatial scramble and territory displacement game. Players are organized into k stationary pair "trees" and k+1 running "squirrels". When the signal is given, all squirrels must vacate their current tree and race to occupy a different tree, leaving exactly one stranded squirrel who becomes the caller for the next round. ## Formal model - **Abstraction taken:** Continuous gym/field space is discretized into a 2D spatial grid where k trees are fixed stations with capacity 1. Movement is modeled with agent velocity and reaction delay. - **Player/agent count:** N=3k+1 agents (2k stationary tree agents forming k trees, k+1 mobile squirrel agents). - **Turn model:** Discrete rounds containing a synchronized sprint phase (tick length = 100 ms). ## Formal rules R1. Setup: k tree locations are placed on a 2D grid with minimum mutual distance dmin=4 units. Each tree is occupied by 1 squirrel; 1 unattached squirrel S0 starts in the center. R2. The Call: The unattached squirrel (or caller) executes `call_change()`. R3. Compulsory Vacate: All k occupied squirrels must vacate their current tree coordinates within treact=5 ticks [gap-fill]. R4. [gap-fill] Anti-Return Constraint: A squirrel cannot re-enter the tree station it occupied at the start of the current round. R5. Occupation: A tree station is claimed by the first squirrel agent whose coordinates reach within distance r≤0.5 of the tree center. Once claimed, the tree is locked for the remainder of the round. R6. Stranded Resolution: After all k trees are locked, the 1 remaining squirrel agent Sstranded is identified. R7. State Update: Sstranded receives a penalty point [gap-fill] and becomes the caller S0 for the next round. R8. Match End: The game concludes after M=10 rounds [gap-fill]. The squirrel agent with the fewest penalty points wins. ## Edge cases - Tie at the end condition: If two agents reach a tree on the exact same tick, priority is resolved by lowest agent id [gap-fill]. - A player with no legal move: Not applicable; all squirrels have k−1 legal destination trees. - Repetition / cycles: Governed by the round limit M. - Simultaneous claims on the same resource or position: Resolved strictly by arrival tick; simultaneous arrivals resolved by R-Tie [gap-fill]. - Player elimination mid-round; turn order repair: If an agent disconnects, k is decremented by 1, converting 1 tree into active squirrels. - Resource exhaustion: k trees are reusable and reset each round. - Termination guarantee: Monotonically guaranteed by the fixed round limit M. ## State representation - Persistent state: Tree coordinates (xt,yt), penalty point vector per squirrel agent, round counter m. - Per-turn ephemeral state: Agent positions (xi,yi), velocities, previous tree occupied per squirrel, tree occupation locks. - Observable information: Fully observable 2D positions of all agents and tree stations. ## Action space - `call_change()`: Executed by caller to start the round. - `move_step(dx, dy)`: Unit grid displacement for mobile squirrels. ## Playability notes - Single-player-vs-AI: Natural; human player acts as a squirrel navigating against heuristic pathfinding AI competitors. - Group games: Easily scales up to 30+ agents. - Physical-skill games: Physical sprinting and reaction time are modeled via agent speed and path efficiency. - What is lost: The physical fun of squeezing into joined arms and physical dodging. ## Implementation hints Spatial multi-agent grid with target reservation logic. Milestone 1: Implement k+1 agents pathfinding to k exclusive targets on a 2D plane. Milestone 2: Enforce the anti-return constraint and measure lock timings.

Download as JSON

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

Download JSON
Cite this page

Squirrels and Trees (Vāverītes) (Latvia). (n.d.). Games of Countries. https://gamesofcountries.com/games/lv-latvia/vaveres-un-koki

@misc{gamesofcountries-lv-latvia-vaveres-un-koki,
  title = {Squirrels and Trees (Vāverītes) (Latvia)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/lv-latvia/vaveres-un-koki}
}