Skip to main content
Formal Specification

What Time Is It, Mr. Fox? (Hong Kong Fox Tag) — Formal Specification

Hong Kong · chase-tag · Confidence: low

← Back to game page

Implementation Suitability

Suitability: adaptation-requiredFidelity: discretizedGap-fills: 4
# Wu Lei Sin Saang — AI-optimized specification ## General idea A spatial proximity-management and chase game based on Hong Kong *Wu Lei Sin Saang* (What Time Is It, Mr. Fox?). Runners advance along a track according to hour callouts made by the Fox; the Fox strategically lures runners into point-blank range before declaring "Twelve o'clock! Dinnertime!" to trigger a frantic reverse sprint to the safety line. ## Formal model - **Abstraction taken:** Continuous play space is formalized as a discrete 1D linear axis (x∈[0,20] meters), where x=0 is the Fox's lair and x=20 is the Runner Safety Zone. Verbal Cantonese time callouts are modeled as discrete integer displacement commands H∈[1,12]. - **Player/agent count:** 1 Fox (F) and N−1 Runners (R1,…,RN−1), where 4≤N≤9. - **Turn model:** Alternating dialogue cycles followed by a real-time discretized pursuit phase upon the strike call. ## Formal rules R1. **Setup & Baseline:** Fox starts at x=0 facing away. All N−1 Runners begin behind the safety line at x=20. Track length L=20. R2. **Dialogue Cycle:** - Runners query: `ASK_TIME`. - Fox responds with action `CALL_HOUR(H)` where H∈{1,2,…,11,12}. R3. **Advance Phase (Hours 1 to 11):** - If H∈{1,…,11}, every active runner advances forward: xi←max⁡(0,xi−H). - **Shoulder Tap Rule:** If any runner reaches xi=0 during an advance phase, they execute `TAP_SHOULDER`, immediately triggering the Escape Phase with a 2-unit head start. R4. **The Strike (Twelve O'Clock / Dinnertime):** - If Fox calls H=12 (`CALL_HOUR(12)`), the Escape Phase is immediately initiated. R5. **Escape & Pursuit Phase:** - The engine simulates a real-time sprint over Tchase=10 ticks. - Each tick, Runners move toward safety (x→20) at speed vrunner=2 units/tick. - Fox pursues toward x=20 at speed vfox=3 units/tick starting from x=0. - **Capture:** If xfox≥xj while xj<20, runner j is captured. The captured runner becomes the new Fox for the subsequent round. - If all runners reach xi≥20 without being tagged, the current Fox retains the role for another round. R6. **Victory Condition:** In a standard 5-round match, the player with the lowest cumulative rounds spent as Fox wins. R7. [gap-fill] Track discretized to a linear 1D corridor of length L=20 units. R8. [gap-fill] Speed differential: Fox pursuit speed vfox=3 units/tick; Runner sprint speed vrunner=2 units/tick. R9. [gap-fill] Shoulder tap benefit: Reaching x=0 before hour 12 grants runners a 2-tick head start before the Fox may begin moving. R10. [gap-fill] Forced strike limit: If Fox has not called H=12 by cycle 8, H=12 is automatically invoked by the engine to prevent infinite stalling. ## Edge cases - **Tie at the end condition:** If Fox tags multiple runners on the exact same tick, the runner with the lower agent ID becomes the new Fox. - **A player with no legal move:** Fox always has choices {1..12}; runners advance deterministically according to the called hour. - **Repetition / cycles:** Small incremental calls (e.g. calling "1 o'clock" repeatedly) are strictly bounded by R10's 8-cycle strike trigger. - **Simultaneous claims on the same resource or position:** Multiple runners reaching x=0 simultaneously trigger a single unified escape phase. - **Player elimination mid-round:** Not applicable (all runners participate in the escape sprint). - **Resource exhaustion:** Track length L=20 is fixed; cycle counter is bounded. - **Termination guarantee:** Guaranteed by finite distance L=20, forced strike limit (R10), and bounded pursuit tick limit Tchase=10. ## State representation - **Persistent state:** `track_length: 20`, `chase_ticks_max: 10`, `max_cycles: 8`. - **Per-player state:** - `positions: Dict[agent_id, float]` - `role: str in {FOX, RUNNER}` - `rounds_as_fox: int` - **Per-turn ephemeral state:** - `current_cycle: int` - `called_hour: Optional[int]` - `chase_active: bool` - `chase_tick: int` - **Observable information:** Fully observable game state. All agent positions, called hours, and sprint velocities are public. ## Action space - `ask_time()`: Preconditions: active Runners during dialogue phase. - `call_hour(hour)`: Parameters: `hour in [1, 12]`. Preconditions: active Fox. - `tap_shoulder()`: Preconditions: Runner at x≤0 before hour 12. - `flee_step()`: Preconditions: Runner during escape chase. - `pursue_step()`: Preconditions: Fox during escape chase. ## Playability notes - **Single-player-vs-AI:** Highly entertaining. As Fox, player calculates optimal strike timing based on runner cluster positions; as Runner, player evaluates whether to rush for a shoulder tap. - **Group games (n>4):** Natively supports 4 to 9 players. - **Physical-skill games:** Physical acceleration and distance estimation are abstracted into velocity differential updates and discrete grid pursuit. - **What is lost in the adaptation:** Authentic high-pitched Cantonese chorus chanting (*Wu-lei sin-saang gei-do dim?*), theatrical fox growls, and playground squeals. ## Implementation hints - Pure discrete state machine: `DIALOGUE -> ADVANCE -> (CHASE or NEXT_CYCLE) -> ROUND_END`. - Branching factor: Fox has 12 discrete hour choices per dialogue cycle; chase phase is fully deterministic given starting coordinates. - First milestone: 2-agent headless simulation (1 Fox, 1 Runner) verifying step-advance calculations, shoulder tap triggers, and pursuit capture resolution.

Download as JSON

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

Download JSON
Cite this page

What Time Is It, Mr. Fox? (Hong Kong Fox Tag) (Hong Kong). (n.d.). Games of Countries. https://gamesofcountries.com/games/hk-hong-kong/wu-lei-sin-saang

@misc{gamesofcountries-hk-hong-kong-wu-lei-sin-saang,
  title = {What Time Is It, Mr. Fox? (Hong Kong Fox Tag) (Hong Kong)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/hk-hong-kong/wu-lei-sin-saang}
}