Skip to main content
Formal Specification

Taiwanese Hopscotch (Stepping on Grids) — Formal Specification

Taiwan · dexterity-throw · Confidence: low

← Back to game page

Implementation Suitability

Suitability: engine-readyFidelity: probabilistic-proxyGap-fills: 3
# Tiao Gezi — AI-optimized specification ## General idea A traditional children's sidewalk hopscotch and territory claiming game (*Tshí-keh-á* / *Thiàu-keh-á*). Players progress through a numbered 8-to-10 square chalk course by tossing a marker stone into sequential boxes, hopping through single-foot and double-foot cells without touching boundary lines, retrieving the marker, and blind-tossing to buy private "houses" that block opponents. ## Formal model - **Abstraction taken:** Single-leg physical balance, stone sliding friction on pavement, and chalk boundary touch detection are abstracted into a discrete grid graph traversal where stone tosses and single-foot hops have parameterized landing probabilities conditioned on target distance and player balance rating. - **Player/agent count:** 1 to 6 players (default 2 to 4). - **Turn model:** Sequential round-robin turn progression. A player continues attempting course stages until committing a fault; on the next turn, the player resumes from the failed stage. ## Formal rules R1. **Grid Layout:** - 8 numbered rectangular cells G1…G8 followed by a semicircular rest zone GHeaven (Cell 9). - Cell types: - Single boxes (1, 2, 3, 6): require single-foot landing (`One-Foot`). - Paired boxes (4-5, 7-8): require simultaneous two-foot landing (`Two-Feet`, left foot in 4, right foot in 5). - Heaven (9): two-foot rest and turnaround zone. R2. **Course Progression (S∈[1..8]):** - On stage S, active player tosses marker stone M aiming for cell GS. - [gap-fill] **Marker Toss Resolver:** Stone lands within target cell GS with probability Ptoss=clamp(0.95−0.05⋅S+0.04⋅skill,0.1,0.98). If the toss fails, stone touches a line or wrong cell → fault. R3. **Hopping Course Execution:** - Player hops from entrance to GHeaven and back, skipping over cell GS (which contains the marker). - For each hopped cell c, landing success is: Phop(c)={0.98if c is owned by active player or unowned0.0if c is an opponent’s claimed House (illegal landing) - In the cell adjacent to GS on the return trip, player balances on one foot, executes `retrieve_marker()`, hops over GS, and exits the grid. R4. **House Purchasing (*Buying a House* / 買房子):** - Upon completing Stage 8, the player reaches the House Claiming Phase. - Standing at GHeaven facing away from the grid, the player executes a blind backward toss `blind_toss_house()`. - [gap-fill] The marker lands uniformly among remaining unowned cells {G1…G8}. The landing cell becomes that player's permanently owned `House`. - Benefit: The owner may rest with both feet inside their house; all opponents must jump completely over it without touching. R5. **Faults & Turn Passing:** - Tossing marker out-of-bounds, stepping on a boundary line, losing balance in a single box, or landing in an opponent's house causes a fault. - Upon a fault, turn passes clockwise to the next player. The player's stage progress S is retained for their next turn. R6. [gap-fill] **Win Condition & Game End:** The game terminates when all 8 cells are claimed as houses (or after 40 global rounds). The player owning the greatest number of houses wins the match. ## Edge cases - **Tie at the end condition:** If two players own equal numbers of houses, rank is broken by the sum of numerical cell indices of owned houses (G8>G1). - **A player with no legal move:** If an opponent owns two adjacent paired cells making hopping across impossible, the blocked player may take a penalty jump action with reduced success probability (P=0.50). - **Repetition / cycles:** Failing tosses repeatedly is bounded by the 40-round global limit (R6). - **Simultaneous claims on the same resource or position:** Blind house tosses landing on an already-owned cell allow 1 immediate re-toss. - **Player elimination mid-round:** Not applicable (non-elimination stage race). - **Resource exhaustion:** Total course cells (8) are finite; claiming houses monotonically decreases available cells. - **Termination guarantee:** Guaranteed by monotonic house claiming and the 40-round game cap. ## State representation - **Persistent state:** - `players`: list of `{id, current_stage, owned_houses: [cell_ids], skill_rating}`. - `cell_ownership`: array of 8 cell owner IDs (or `Unowned`). - `active_player_idx`: integer in [0..N−1]. - `total_rounds_elapsed`: integer. - **Per-turn ephemeral state:** - `marker_cell`: integer ∈[1..8]. - `player_position`: current cell index. - `foot_stance`: enum `[One-Foot, Two-Feet]`. - **Observable information:** Fully observable grid ownership map and player progress stages. ## Action space - `toss_marker(target_cell)`: Execute stage marker toss (S∈[1..8]). - `hop_step(target_cell)`: Advance hop sequence through course. - `retrieve_marker()`: Pick up stone from target cell while balancing. - `blind_toss_house()`: Blind toss to buy a house. ## Playability notes - **Single-player-vs-AI:** Highly playable; an AI agent optimizes hop pathing and risk estimation over contested cells. - **Group games (n>4):** Supports 2 to 6 players naturally in round-robin turns. - **Physical-skill games:** Physical hopping balance and line evasion are formalized into stage-dependent discrete probabilities. - **What is lost in the adaptation:** Physical chalk dust on shoes, playground breeze, and single-leg muscle burning. ## Implementation hints - Discrete graph traversal over a 9-node chain/bipartite lattice. - Path validity checking against `cell_ownership` is a fast bitmask lookup. - Suggested first milestone: Implement single-player 8-stage progression with chalk fault detection and house claiming.

Download as JSON

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

Download JSON
Cite this page

Taiwanese Hopscotch (Stepping on Grids) (Taiwan). (n.d.). Games of Countries. https://gamesofcountries.com/games/tw-taiwan/tiao-gezi

@misc{gamesofcountries-tw-taiwan-tiao-gezi,
  title = {Taiwanese Hopscotch (Stepping on Grids) (Taiwan)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/tw-taiwan/tiao-gezi}
}