Skip to main content
Formal Specification

Hopscotch — Formal Specification

Singapore · dexterity-throw · Confidence: high

← Back to game page

Implementation Suitability

Suitability: engine-readyFidelity: probabilistic-proxyGap-fills: 3
# Main Ting-ting — AI-optimized specification ## General idea Main Ting-ting is a turn-based board-and-agility traversal game where agents throw a marker into numbered cells on an 8-node linear graph, traverse the valid nodes under hopping movement constraints, and purchase completed cells as exclusive territory ("houses") to create movement obstacles for opponents. ## Formal model - **Abstraction taken:** The physical court is modeled as a connected topological graph G=(V,E) with nodes V={1..8}. Single nodes require 1 movement point; paired nodes (wings) allow simultaneous 2-point landing. Throw accuracy and hopping balance are modeled via stochastic success functions. - **Player/agent count:** 2 to 6 agents taking sequential turns. - **Turn model:** Sequential turns with progressive stage advancement. ## Formal rules R1. Court Topology: Graph nodes V={1..8}, with node types: - Single cells: {1,2,5,8} (single foot landing). - Wing pairs: {3,4} and {6,7} (split feet landing). - State per cell: `marker_present`, `owner` ∈{0,1..N}. R2. Progress Tracking: Each agent maintains `target_cell` ∈{1..8,house_phase} and `houses_owned` ⊂V. R3. Marker Throw Phase: - The active agent targets `target_cell` k. - Success probability P(throw_land)=clamp(0.20,0.95,aim_skill−0.05×k). - If the throw fails (lands off-grid or on line), the turn ends immediately. R4. Hop Traversal Phase: - If the marker lands cleanly in cell k, the agent attempts traversal from node 1 to 8 and back to 1. - Traversal constraint: Node k and any node owned by an opponent (`owner` ∉{0,agent_id}) must be skipped entirely. - Balance check: For each traversed node, a balance check P(balance)=clamp(0.40,0.98,balance_skill) is evaluated. If any balance check fails, the turn ends. - Pickup: On the return path, the agent pauses adjacent to node k, executes pickup check P(pickup)=0.90, and exits. - If full traversal succeeds, `target_cell` increments k←k+1. R5. House Claiming Phase: - When an agent completes k=8, they enter the house claiming phase. - A blind throw is executed: a randomly selected unowned cell h∈V is claimed by the agent (`owner` [h]←agent_id). - `target_cell` resets to 1, allowing the agent to cycle through the grid again to claim additional houses. R6. Win Condition: When all 8 cells are claimed as houses, the agent owning the most houses wins the match. [gap-fill] If 30 rounds conclude without all cells claimed, the agent with the most claimed houses (or highest `target_cell` progress) wins. ## Edge cases - Tie at the end condition: If two agents have equal houses owned at game conclusion, a single sudden-death marker throw into cell 8 decides the tie. - A player with no legal move: If opponent houses block all reachable path nodes so that traversal is physically impossible (no valid hop landing path), the blocked agent skips their hop phase and is awarded a free house attempt [gap-fill]. - Repetition / cycles: Bounded by the 30-round maximum limit [gap-fill]. - Simultaneous claims on the same resource or position: Turns are strictly sequential; cell ownership is mutually exclusive. - Player elimination mid-round: Not applicable; all players remain active until match conclusion. - Resource exhaustion: The 8 cells are finite and monotonically acquired into private ownership. - Termination guarantee: Guaranteed by monotonic cell acquisition (|Vunowned|→0) backed by the 30-round cap. ## State representation - Persistent state: - `cell_owners`: array of size 8 (values in 0..N). - `player_targets`: array of size N (integers 1..8). - `active_player`: integer 1..N. - `round_count`: integer 0..30. - Ephemeral state: - `active_marker_cell`: integer ∈{0,1..8}. - Observable information: Fully observable to all agents. ## Action space - `throw_marker(target_cell)`: Initiates marker toss. - `attempt_traversal()`: Triggers sequential graph traversal and balance evaluations. - `blind_throw_house()`: Executes house acquisition throw. ## Playability notes - Single-player-vs-AI: Fully natural; AI evaluates risk of marker misses versus cell purchase priorities. - Group games (n>4): Plays smoothly with standard sequential turn rotation. - Physical-skill games: Balance and aim are abstracted into decoupled statistical success rates. - What is lost: Physical hopping fatigue on one leg, foot cramps, and chalk line boundary disputes. ## Implementation hints Discrete graph traversal with simple state transitions. Highly modular and easily verified with unit tests.

Download as JSON

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

Download JSON
Cite this page

Hopscotch (Singapore). (n.d.). Games of Countries. https://gamesofcountries.com/games/sg-singapore/main-ting-ting

@misc{gamesofcountries-sg-singapore-main-ting-ting,
  title = {Hopscotch (Singapore)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/sg-singapore/main-ting-ting}
}