Formal Specification
Higher than the Ground (Off-Ground Tag) — Formal Specification
Latvia · chase-tag · Confidence: low
← Back to game pageImplementation Suitability
Suitability: adaptation-requiredFidelity: discretizedGap-fills: 10
# Augstāk par zemi — AI-optimized specification
## General idea
A spatial tag game featuring vertical topology and temporary immunity. Runners navigate an arena containing ground cells and elevated perch cells (stones, benches, logs) where feet leave the ground; standing on an elevated perch confers complete immunity from tagging, but a strict anti-camping countdown forces runners to descend back to ground level after a fixed duration.
## Formal model
- **Abstraction taken:** Continuous physical terrain is mapped to a 2D grid containing two cell types: ground cells and elevated perch cells. Continuous chasing and verbal countdowns are discretized into synchronous movement ticks with an integer perch occupancy timer.
- **Player/agent count:** 1 catcher agent and runner agents ().
- **Turn model:** Synchronous discrete-time ticks (simultaneous action selection and resolution).
## Formal rules
R1. **Arena topology:** A bounded grid containing normal ground cells and a set of designated elevated perch cells [gap-fill: default grid with 10–15% cells marked as perches, each perch having capacity 1].
R2. **Initial placement:** Catcher starts at center ; runners start distributed on ground or perch cells with Manhattan distance from catcher [gap-fill].
R3. **Movement capabilities per tick:**
- Runners can move 1 cell orthogonally/diagonally or `stay` [gap-fill].
- Catcher moves up to 2 cells per tick across ground cells (representing pursuit speed advantage), but cannot enter elevated perch cells [gap-fill].
R4. **Immunity and perch timer:**
- A runner occupying a perch cell is immune to tagging.
- An integer counter `perch_timer` increments by 1 for each consecutive tick a runner spends on a perch.
- When `perch_timer` reaches ticks, the perch expires: immunity is lost, and the runner cannot re-enter any perch until they have spent at least 2 ticks on ground cells [gap-fill].
R5. **Tagging resolution:**
- If the catcher enters the cell of a runner who is on a ground cell, or on an expired perch cell, that runner is tagged.
R6. **Role swap and grace period:**
- The tagged runner immediately becomes the new catcher.
- The former catcher becomes a regular runner and receives a temporary immunity grace period of ticks [gap-fill].
R7. **Match termination:** The game runs for a fixed duration ticks, or until an agreed score target is met [gap-fill].
## Edge cases
- Tie at the end condition: not applicable — scoring tracks cumulative time spent as catcher (lowest time wins); in case of equal time, the player with the most successful tags wins [gap-fill].
- A player with no legal move: not applicable — `stay` is always a valid action unless on an expired perch, where stepping onto an adjacent ground cell is mandatory.
- Repetition / cycles: bounded by the global tick limit ticks; anti-camping timers strictly prevent perch-squatting cycles.
- Simultaneous claims on the same resource or position: if two runners attempt to enter the same single-capacity perch on the same tick, the agent with lower ID claims the perch, and the other remains in their previous cell [gap-fill].
- Player elimination mid-round: not applicable — all players remain active throughout; roles cycle dynamically upon tag events.
- Resource exhaustion: not applicable — grid cells and perches are static and never consumed.
- Termination guarantee: guaranteed by the strict global tick bound .
## State representation
- Persistent state: grid dimensions , perch coordinates , current catcher ID, cumulative catcher time per agent, round tick limit .
- Per-turn ephemeral state: current coordinates for all agents, `perch_timer` per runner, `grace_timer` for former catcher, current tick .
- Observable information: full public observability — all agent positions, perch locations, and active timers are observable by all agents.
## Action space
- `move(direction)`: . Precondition: target cell must be within grid bounds and cannot exceed perch capacity.
## Playability notes
- Single-player-vs-AI: natural — human plays as runner navigating path planning between perches against an optimal pursuing AI catcher, or as catcher cutting off runner escape paths.
- Group games (n>4): natively supports large agent pools (). Reduction to 2 agents (1 catcher vs 1 runner) requires reducing total perch count (e.g. 2 perches total) and reducing perch duration to 5 ticks to maintain pursuit tension [gap-fill].
- Physical-skill games: vertical climbing and physical balance are abstracted into cell-type topological immunity and timer constraints.
- What is lost: physical climbing mechanics, bodily reach around obstacles, and balance-loss slips.
## Implementation hints
Low complexity, fully deterministic state machine. Highly suitable for gridworld reinforcement learning and pathfinding benchmarks. First milestone: implement 2D grid with ground vs perch cells, perch timeout logic, and catcher collision detection.
Download as JSON
Download the full game corpus entry for this game as structured JSON.
Download JSONCite this page
Higher than the Ground (Off-Ground Tag) (Latvia). (n.d.). Games of Countries. https://gamesofcountries.com/games/lv-latvia/augstak-par-zemi
@misc{gamesofcountries-lv-latvia-augstak-par-zemi,
title = {Higher than the Ground (Off-Ground Tag) (Latvia)},
year = {n.d.},
publisher = {Games of Countries},
url = {https://gamesofcountries.com/games/lv-latvia/augstak-par-zemi}
}