Skip to main content
Formal Specification

Banyan Tree Ghost (Circle and Diameter Tag) — Formal Specification

Myanmar · chase-tag · Confidence: high

← Back to game page

Implementation Suitability

Suitability: engine-readyFidelity: discretizedGap-fills: 3
# Nyaung-pin-tasae — AI-optimized specification ## General idea A traditional moonlit circle-tag evasion game rooted in tree-spirit folklore. One player acts as the "Banyan Tree Ghost" (*Tasae*), restricted to patrolling along the outer circular boundary and a straight bisecting diameter line (the tree trunk and branches). The other players (Runners) dance inside the two safe semicircular halves, chanting taunting rhymes and darting across the diameter line without getting tagged by the ghost. ## Formal model - **Abstraction taken:** The continuous circular court (6.0 m diameter) is discretized onto a 2D coordinate grid with radius R=3 centered at (0,0). The Ghost is mathematically constrained to coordinates satisfying x2+y2=9 (circumference) OR x=0 for y∈[−3,3] (diameter spine line). Runners may occupy any interior cell with x2+y2<9 and x≠0. - **Player/agent count:** 1 Ghost agent G and K∈{3…11} Runner agents {R1…RK}. - **Turn model:** Synchronous discrete simulation ticks t=1,2,…,Tmax⁡. ## Formal rules R1. **Court & Initial Positions:** - Ghost G starts at (0,−3) on the boundary line. - Runners {R1…RK} start distributed within the left (x<0) and right (x>0) interior semicircles. - Each Runner maintains a mandatory crossing timer cj=0. R2. **Movement Constraints:** - *Ghost:* Speed = 1 grid step per tick. Must always occupy a cell (x,y) such that (x2+y2=9)∨(x=0∧|y|≤3). - *Runners:* Speed = 1 grid step per tick within the interior disk (x2+y2<9). R3. **Mandatory Crossing Rule:** - To prevent permanent stalling in safe corners, every Runner must cross from one semicircular half to the other across x=0 at least once every Ccross=20 ticks. - If a Runner's crossing timer reaches cj≥20 without crossing, that Runner is forced to take shortest-path steps toward x=0 on subsequent ticks until crossing is completed [gap-fill]. R4. **Tagging & Capture Mechanics:** - A tag occurs at tick t if the Euclidean distance between Ghost G (standing on a legal line cell) and any Runner Rj satisfies ‖pos(G)−pos(Rj)‖≤1.0. - If a tag occurs: Runner Rj is **Captured** (*Mi-the*); the round ends immediately. - Rj becomes the Ghost for the subsequent round. R5. **Round End & Survival Victory:** - If no Runner is tagged after Tmax⁡=100 ticks, the Runners win the round; the Ghost remains Ghost for another round (*Danda-khat* penalty). R6. [gap-fill] Multi-Round Match Score:** A full match consists of M=5 rounds. Each runner accumulates +1 point for every round completed as an uncaught human. The player with the highest score at match end wins. ## Edge cases - Tie at the end condition: Standard round ends cleanly on first tag or tick expiration. In multi-round tournament play, tied scores share the victory or play a 1-round sudden-death playoff [gap-fill]. - A player with no legal move: Not applicable; staying stationary (0,0) or moving in any legal cardinal direction is always valid. - Repetition / cycles: Runners circling within a semicircle are forced to engage the diameter line by the mandatory crossing counter in R3, and bounded by Tmax⁡=100. - Simultaneous claims on the same resource or position: Runners can co-locate in interior cells. Multiple simultaneous tags in one tick all trigger the single round-end event (with lowest-ID runner becoming the new Ghost). - Player elimination mid-round; turn order repair: If an individual runner disconnects, they are removed from the active set; the round continues with remaining runners without modifying the simulation loop. - Resource exhaustion (pieces, tokens, space, time): The circular court is spatially bounded (R=3); match ticks bounded at 100. - Termination guarantee: why the game provably ends: Guaranteed by monotonic tick progression t→Tmax⁡=100 in every round. ## State representation - **Persistent state:** Number of players K+1, current round m∈{1…5}, match scores {S1…SK+1}, active Ghost ID. - **Per-turn ephemeral state:** Tick t∈{1…100}, agent positions {pos(G),pos(R1)…pos(RK)}, runner crossing timers {c1…cK}, round active flag. - **Observable information:** Fully observable; all player positions, line markings, and crossing timers are public knowledge. ## Action space - **Ghost Actions:** `move(direction)` where `direction` ∈{STAY,ALONG_DIAMETER,ALONG_PERIMETER}. - **Runner Actions:** `move(direction)` where `direction` ∈{STAY,NORTH,SOUTH,EAST,WEST}. ## Playability notes - Single-player-vs-AI: Very dynamic; human player operates the Ghost cutting across the central diameter to intercept dodging AI runners, or plays a runner timing crossing sprints. - Group games (n>4): Natively accommodates 4 to 12 agents in a discrete spatial gym environment. - Physical-skill games: Peripheral vision, vocal taunting, and sprint agility are discretized into line traversal constraints and crossing countdowns. - What is lost in the adaptation: The atmospheric moonlight setting, traditional Burmese singing chants (*Nyaung-pin-tasae way lay lay...*), and physical tagging contact. ## Implementation hints Low complexity. The 2D geometry is easily encoded as a graph where Ghost nodes form a "theta" (Θ) graph (circle plus diameter) and Runner nodes form two interior cell meshes. First milestone: implement 1 Ghost vs 2 Runners on a graph court and verify line constraints and tag detection.

Download as JSON

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

Download JSON
Cite this page

Banyan Tree Ghost (Circle and Diameter Tag) (Myanmar). (n.d.). Games of Countries. https://gamesofcountries.com/games/mm-myanmar/nyaung-pin-tasae

@misc{gamesofcountries-mm-myanmar-nyaung-pin-tasae,
  title = {Banyan Tree Ghost (Circle and Diameter Tag) (Myanmar)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/mm-myanmar/nyaung-pin-tasae}
}