Skip to main content
Formal Specification

Dragon Snake Ascends to the Clouds — Formal Specification

Vietnam · chase-tag · Confidence: medium

← Back to game page

Implementation Suitability

Suitability: engine-readyFidelity: discretizedGap-fills: 4
# Rồng rắn lên mây — AI-optimized specification ## General idea Rồng rắn lên mây is a classic Vietnamese children's pursuit-and-shielding tag game. A solo "Doctor" (*Thầy thuốc*) attempts to tag the vulnerable child at the tail of an interlocked "dragon-snake" chain. The older child leading as the "Dragon Head" spreads arms to block and parry the Doctor's advances, while the connected body segments swerve in synchronized evasion to keep the tail out of reach without breaking the chain. ## Formal model - **Abstraction taken:** The continuous physical maneuvering of holding waists and dodging is discretized onto a 2D grid (N×M). The dragon is modeled as a kinematic snake chain of length L where each segment k automatically follows the previous position of segment k−1 from the prior tick [gap-fill: continuous running and body interlocking are discretized onto a 2D grid with kinematic chain constraints (each segment follows the position of the preceding segment from the previous tick) and Doctor pursuit-blocking physics]. - **Player/agent count:** 2 decision agents: Doctor (D) and Dragon Head (H), with the dragon body containing L−1 following segments terminating at Tail (T=SL). - **Turn model:** Simultaneous tick-by-tick discrete action updates (t=1,…,Tmax). ## Formal rules R1. Arena and Setup: - Arena: 2D grid A={(x,y):0≤x<W,0≤y<H} (e.g. 15×15). - Dragon chain: Initialized as an ordered list of L coordinates [S1,S2,…,SL], where S1=H (Head) and SL=T (Tail). Adjacent segments satisfy Manhattan distance |Sk−Sk+1|=1. - Doctor D starts at coordinate pD∈A, separated from the dragon. R2. Movement and Kinematic Chain Update (per tick t): - Head H submits action aH∈{UP,DOWN,LEFT,RIGHT,STAY}. - Doctor D submits action aD∈{UP,DOWN,LEFT,RIGHT,STAY}. - Kinematic propagation: - Head updates: S1(t+1)=S1(t)+Δ(aH) (constrained within arena bounds). - Body segments follow: Sk(t+1)=Sk−1(t) for all k∈{2,…,L}. - Doctor updates: pD(t+1)=pD(t)+Δ(aD). R3. [gap-fill] Head Blocking and Collision Constraints: - The Dragon Head exerts a protective blocking cone BH: the 3 frontal and adjacent cells facing aH. - The Doctor cannot move into any cell occupied by a dragon body segment Sk, nor into the Head's blocking cone BH; attempted moves into blocked cells result in the Doctor staying in place for that tick. R4. Tagging and Capture: - If Doctor position equals Tail position (pD=SL) at the end of tick t: - Doctor successfully tags the Tail (`TAG` event). - Doctor wins the round immediately. R5. [gap-fill] Chain Rupture Penalty: - If the distance between any adjacent dragon segments |Sk−Sk+1|>1 (chain breaks), the Dragon automatically incurs a structural fault and the Doctor is awarded an immediate victory. R6. [gap-fill] Chase Time Limit: - The chase phase is bounded by Tmax=60 ticks. - If Tmax expires without the Doctor tagging the Tail or causing a chain break, the Dragon wins the round. ## Edge cases - Tie at the end condition: Not applicable; either Doctor tags Tail (Doctor win), or time expires (Dragon win). - A player with no legal move: Both agents always have the `STAY` action available. - Repetition / cycles: Bounded by the hard round limit Tmax=60 in R6. - Simultaneous claims on the same resource or position: Handled by R4 (tag event) and R3 (blocking/collision rules). - Player elimination mid-round; turn order repair: No elimination; both agents maintain active roles throughout the round. - Resource exhaustion: Dragon length L is constant during a round; time ticks decrement to Tmax. - Termination guarantee: why the game provably ends: Guaranteed by R6 (t≤60 ticks). ## State representation - Persistent state: - `arena_width`, `arena_height`: integers (e.g. 15, 15). - `chain_length`: integer L∈[5,12]. - `doctor_wins`, `dragon_wins`: non-negative integers. - Per-round ephemeral state: - `doctor_pos`: coordinate (xD,yD). - `dragon_segments`: list of L coordinates [(x1,y1),…,(xL,yL)]. - `current_tick`: integer t∈[0,60]. - Observable information: - Fully observed by both agents: full grid positions of all dragon segments and the Doctor. ## Action space - Doctor Agent: - `move(direction)`: direction ∈{STAY,UP,DOWN,LEFT,RIGHT}. - Dragon Head Agent: - `move(direction)`: direction ∈{STAY,UP,DOWN,LEFT,RIGHT}. ## Playability notes - Single-player-vs-AI: Highly playable; human plays as the Doctor searching for flank openings around the blocking head, or as the Dragon Head managing snake curvature and blocking shields against an AI pursuer. - Group games (n>4): The traditional game features 6–15 children; the multi-body kinematic model collapses the body coordination into a 2-agent strategic game without discarding snake physics. - Physical-skill games: Physical grip strength and lateral running agility are mapped into the kinematic chain propagation and blocking cone rules. - What is lost in the adaptation: The charming spoken dialogue ("Is the doctor home?", "The head is full of bones!"), laughter, and the centrifugal whip-like pull on the tail children. ## Implementation hints - Implement as a 2D GridWorld with classic "Snake" body-following FIFO buffer mechanics. - Precompute blocking cone BH relative to Head's movement direction. - Suggested first milestone: Implement R1–R2 kinematic chain and verify that Tail smoothly traces Head's historical coordinates over a 20-tick zigzag path.

Download as JSON

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

Download JSON
Cite this page

Dragon Snake Ascends to the Clouds (Vietnam). (n.d.). Games of Countries. https://gamesofcountries.com/games/vn-vietnam/rong-ran-len-may

@misc{gamesofcountries-vn-vietnam-rong-ran-len-may,
  title = {Dragon Snake Ascends to the Clouds (Vietnam)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/vn-vietnam/rong-ran-len-may}
}