Skip to main content
Formal Specification

Macau Hopscotch — Formal Specification

Macau · dexterity-throw · Confidence: medium

← Back to game page

Implementation Suitability

Suitability: adaptation-requiredFidelity: probabilistic-proxyGap-fills: 3
# Tiu fēi-gēi — AI-optimized specification ## General idea A turn-based progression game where players toss a marker into sequentially numbered squares and hop through a grid. Physical hopping skill is abstracted into probability-gated success checks. First player to complete all squares wins. ## Formal model - **Abstraction taken:** Physical hopping and balance replaced by a per-square success probability. Toss accuracy modeled as a probability check. [gap-fill] - **Player/agent count:** 2–6 individual agents. - **Turn model:** Sequential round-robin. ## Formal rules R1. Grid has N=8 numbered squares in sequence. R2. On a turn, the active player attempts their current target square S. R3. Toss check: probability p_toss = 0.8 of landing in the correct square. Failure → turn ends. R4. Hop check: probability p_hop = 0.85 of completing the hop sequence. Failure → turn ends. R5. Both succeed → player advances to S+1. R6. [gap-fill] If a player fails, they retry the same square next turn. R7. First player to complete square N wins. R8. [gap-fill] If no winner after 60 total rounds, player at highest square wins. ## Edge cases - **Tie at the end condition:** Players at the same highest square share victory or play a tiebreaker round. - **A player with no legal move:** Always has an attempt available. - **Repetition / cycles:** Players can fail the same square repeatedly; bounded by R8. - **Simultaneous claims on the same resource or position:** Sequential turns prevent conflicts. - **Player elimination mid-round:** Not applicable; no elimination. - **Resource exhaustion:** Not applicable. - **Termination guarantee:** Guaranteed by round cap R8. ## State representation - **Persistent state:** `current_square[player_id]` ∈ {1..N, Finished}, `round_number`. - **Per-turn state:** `active_player`, `toss_result`, `hop_result`. - **Observable information:** Fully observable. ## Action space - `attempt_square()`: Attempt toss + hop for current square. ## Playability notes - **Single-player-vs-AI:** Natural as 1v1 race. - **Group games (n>4):** Scales naturally. - **Physical-skill games:** Hop/toss skill → probability parameter. - **What is lost:** Physical balance challenge and the specific pleasure of playing on cobblestone. ## Implementation hints Simple sequential race with Bernoulli trials. Minimal state. Can be implemented in a few dozen lines.

Download as JSON

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

Download JSON
Cite this page

Macau Hopscotch (Macau). (n.d.). Games of Countries. https://gamesofcountries.com/games/mo-macau/tiu-feigei

@misc{gamesofcountries-mo-macau-tiu-feigei,
  title = {Macau Hopscotch (Macau)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/mo-macau/tiu-feigei}
}