Skip to main content
Formal Specification

Dragon Gate & Tail Snatching / Oray-orayan — Formal Specification

Indonesia · singing-circle · Confidence: low

← Back to game page

Implementation Suitability

Suitability: engine-readyFidelity: discretizedGap-fills: 4
# Ular Naga — AI-optimized specification ## General idea A two-phase multi-agent game comprising: (1) a hidden-choice recruitment procession where a moving agent chain passes through a gate and members select secret team affiliations ("Moon" vs "Star"), and (2) a real-time kinematic snake duel where two leaders maneuver across a 2D plane to tag the trailing tail segment of the opposing snake while shielding their own. ## Formal model - **Abstraction taken:** The singing gate is modeled as a discrete sequential allocation mechanism. The combat duel is modeled on a 2D continuous field [0..20]×[0..20] where team members follow their leader via kinematic inverse-kinematics (IK) line tracking with fixed inter-segment link distance d=1.0 m. - **Player/agent count:** 2 Leader agents (LA,LB) commanding chains of KA,KB≥2 follower agents. - **Turn model:** Simultaneous tick execution (Δt=100 ms). ## Formal rules R1. Phase 1 — Team Formation: - N follower agents choose sequentially between secret tokens `TEAM_MOON` (TA) and `TEAM_STAR` (TB) with uniform random or policy choice, forming two squads [gap-fill]. R2. Phase 2 — Dragon Duel Setup: - Leader LA starts at (5,10) facing (1,0); followers A1…AKA trail behind at x=5−i×1.0,y=10. - Leader LB starts at (15,10) facing (−1,0); followers B1…BKB trail behind at x=15+j×1.0,y=10. R3. Kinematic movement: - Each tick, leaders submit velocity vector v→L∈ℝ2 with ‖v→L‖≤2.0 m/s. - Follower segments update position: segment i moves toward segment i−1 maintaining rigid distance constraint d(pi,pi−1)=1.0 m [gap-fill]. R4. Tagging & collision resolution: - If Leader LA reaches within Euclidean distance ≤0.8 m of the final tail segment Btail, LA scores a TAG on Team B. - If Leader LB reaches within Euclidean distance ≤0.8 m of Atail, LB scores a TAG on Team A. - If a leader collides with an intermediate non-tail segment of the opposing snake, the move is obstructed (elastic bounce) without registering a score [gap-fill]. R5. Win condition: The first team whose leader successfully tags the opposing snake's tail segment wins the match. R6. Hard time horizon [gap-fill]: If neither tail is tagged by tick Tmax⁡=600 (60 s), the team with the longer snake (or smaller minimum distance to enemy tail) wins. ## Edge cases - Tie at the end condition: If both leaders tag opposing tails on the exact same tick, the duel continues in sudden-death until the next tag. - A player with no legal move: (0,0) (remain stationary) is always legal. - Repetition / cycles: Bounded by finite tick limit Tmax⁡=600 ticks. - Simultaneous claims on the same resource or position: Leaders cannot occupy the same coordinate; elastic repulsion resolves head-to-head collisions. - Player elimination mid-round: If a tail segment is tagged, the round terminates immediately (terminal state). - Resource exhaustion: Not applicable. - Termination guarantee: Enforced by the finite time horizon Tmax⁡=600 ticks. ## State representation - Persistent state: - `snakes`: array of 2 objects `{leader_id, head_pos: (x, y), body_segments: [(x_1, y_1), ...], status: ACTIVE}`. - `current_tick`: integer 0..600. - Per-tick ephemeral state: - `leader_velocities`: `[\vec{v}_A, \vec{v}_B]`. - Observable information: Fully observable (all positions, chain lengths, and velocities are public). ## Action space - `move_leader(vx, vy)`: vx,vy∈[−2.0,2.0] m/s such that vx2+vy2≤4.0. ## Playability notes - Single-player-vs-AI: Excellent as a dynamic 2D kinematic pursuit-evasion control game where an AI snake leader balances tail offense and body blocking defense. - Group games (n>4): The multi-child chain is modeled via deterministic inverse-kinematics physics, preserving multi-player spatial dynamics while requiring only 2 active decision agents (the two leaders). - Physical-skill games: Physical grip holding and spatial dodging are modeled through rigid kinematic link constraints. - What is lost in the adaptation: The melodic group singing and the giggling chaos of children falling down when the snake whips around rapidly is abstracted into geometric links. ## Implementation hints Standard inverse kinematics particle chain with verlet integration. First milestone: Implement 1 leader maneuvering a 4-segment trailing snake within a 20×20 box before adding the opposing AI dragon leader.

Download as JSON

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

Download JSON
Cite this page

Dragon Gate & Tail Snatching / Oray-orayan (Indonesia). (n.d.). Games of Countries. https://gamesofcountries.com/games/id-indonesia/ular-naga

@misc{gamesofcountries-id-indonesia-ular-naga,
  title = {Dragon Gate & Tail Snatching / Oray-orayan (Indonesia)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/id-indonesia/ular-naga}
}