Skip to main content
Formal Specification

Heaven and Earth Tag — Formal Specification

Philippines · chase-tag · Confidence: low

← Back to game page

Implementation Suitability

Suitability: engine-readyFidelity: discretizedGap-fills: 4
# Langit-Lupa — AI-optimized specification ## General idea A 2D discrete grid pursuit-evasion game with heterogeneous terrain heights. The arena contains flat ground cells (*Lupa*, elevation Z=0) and elevated sanctuary cells (*Langit*, elevation Z=1). Runners standing on Z=1 have immunity from tagging but are subject to a strict countdown timer (Tstay≤10 ticks); the Chaser moves across Z=0 attempting to tag any Runner occupying or transitioning across Z=0. ## Formal model - **Abstraction taken:** Arena is discretized into a 2D integer grid of size X∈[0..20],Y∈[0..20]. Each cell (x,y) has terrain property Z(x,y)∈{0,1}. Z=1 cells represent elevated platforms with a capacity of at most 2 agents [gap-fill]. The Chaser C is strictly constrained to Z=0 cells; Runners R1..Rk can occupy both Z=0 and Z=1. - **Player/agent count:** 1 Chaser (C) and k Runners (R1..Rk), with k∈[2..5]. - **Turn model:** Simultaneous discrete execution ticks (Δt=1 step per round). ## Formal rules R1. Setup: - Chaser C is assigned via initial round-robin chant simulator or uniform sampling. - Chaser spawns at ground center (10,10,0). - Runners R1..Rk spawn on distinct elevated platforms with Z=1. - Platform stay timer for each runner is initialized: `stay_timer[i] = 0`. R2. Movement & Platform Constraints: - Every tick, all agents submit a 4-directional movement vector v→∈{(0,1),(0,−1),(1,0),(−1,0),(0,0)}. - For Chaser C: Destination (x′,y′) must satisfy Z(x′,y′)==0. - For Runners Ri: - If on Z=1 and v→==(0,0), `stay_timer[i]` increments by +1. - If `stay_timer[i] > 10` (stay ceiling): Runner is forced off platform; v→ must move to an adjacent Z=0 cell, and `stay_timer[i]` resets to 0 [gap-fill]. - Platform capacity limit: If a Z=1 cell already contains 2 runners, a 3rd runner attempting to enter is blocked or displaced onto Z=0. R3. Tagging Resolution: - A tag occurs at tick t if distance(C,Ri)≤1.0 unit AND Z(pos(Ri))==0. - If tagged: - Runner Ri becomes the new Chaser (C′←Ri). - Former Chaser C becomes a Runner and receives an invulnerability shield for 5 ticks to seek platform sanctuary (`immune_timer = 5`) [gap-fill]. - `taya_duration[R_i]` records time spent as Chaser. R4. Scoring & Termination: - Game runs for a fixed global horizon of Tmax⁡=500 ticks. - Each agent's objective is to minimize total ticks spent as the Chaser: penaltyi=∑ticks as Chaser. - The agent with the minimum Chaser penalty wins the match. ## Edge cases - Tie at the end condition: If two agents have equal minimum Chaser duration, the runner with more platform transitions is ranked higher [gap-fill]. - A player with no legal move: (0,0) is legal on platforms (up to stay limit) and ground; forced descent resolves any stalling. - Repetition / cycles: Bounded by the hard global countdown clock Tmax⁡=500 ticks. - Simultaneous claims on the same resource or position: Platform capacity is capped at 2; conflicts resolve by agent index order. - Player elimination mid-round: Dynamic role swap without agent elimination. - Resource exhaustion: Elevated platforms are permanent and reusable. - Termination guarantee: Enforced by the global tick horizon Tmax⁡. ## State representation - Persistent state: - `grid_elevation`: 20×20 binary matrix (0 = ground, 1 = platform). - `agent_positions`: array of coordinates (x,y). - `current_chaser_id`: integer 0..k. - `stay_timers`: array of size k+1. - `immune_timers`: array of size k+1. - `chaser_accumulated_ticks`: array of size k+1. - `current_tick`: integer 0..500. - Observable information: Fully observable public state. ## Action space - `move(dx, dy)`: Δx∈{−1,0,1},Δy∈{−1,0,1} with |Δx|+|Δy|≤1, subject to terrain height constraints. ## Playability notes - Single-player-vs-AI: Playable as a high-speed parkour evasion challenge against an intelligent hunting AI. - Group games (n>4): Easily accommodates 3 to 6 agents on a standard platform map. - Physical-skill games: Real-world climbing balance is abstracted into discrete elevation zones and platform stay timers. - What is lost in the adaptation: The physical scramble of multiple children crowding onto a narrow wooden bench. ## Implementation hints 2D discrete matrix with elevation bitmask. Pathfinding for Chaser can use A* on the sub-graph where Z=0. First milestone: Implement 1 Chaser vs 2 Runners on a small 10x10 map with 2 platform islands to verify stay timer forced-descent logic.

Download as JSON

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

Download JSON
Cite this page

Heaven and Earth Tag (Philippines). (n.d.). Games of Countries. https://gamesofcountries.com/games/ph-philippines/langit-lupa

@misc{gamesofcountries-ph-philippines-langit-lupa,
  title = {Heaven and Earth Tag (Philippines)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/ph-philippines/langit-lupa}
}