Formal Specification
Austrian hopscotch (Himmel und Hölle) — Formal Specification
Austria · dexterity-throw · Confidence: low
← Back to game pageImplementation Suitability
Suitability: engine-readyFidelity: probabilistic-proxyGap-fills: 0
# Tempelhüpfen — AI-optimized specification
## General idea
A turn-based sequential obstacle course and dexterity game. Agents throw a marker stone into a numbered 10-box court graph, hop on one foot through the sequence of single and paired nodes, retrieve the stone while balancing on one foot, and hop out. A fault immediately passes the turn; the first agent to clear all 10 stages wins.
## Formal model
- **Abstraction taken:** The 2D chalk court is modeled as a connected planar topological graph with nodes . Node hopping and stone throwing are governed by parameter distributions over aim accuracy and single-leg balance stability.
- **Player/agent count:** agents ().
- **Turn model:** Strictly sequential rounds; an agent continues playing until committing a fault, whereupon the turn passes to the next agent in circular rotation.
## Formal rules
R1. State Initialization: Each agent starts at progress level (target box 1).
R2. Stone Toss:
- On active turn at level , agent throws stone at box .
- Landing accuracy .
- If stone lands off-target or on a boundary line: `Fault`. Turn ends immediately; remains unchanged.
R3. Hopping Traversal:
- Agent traverses nodes (omitting node ):
- Single nodes : execute `single_foot_hop()`.
- Paired straddle nodes and : execute `straddle_land()`.
- Heaven node : execute `turnaround()`.
- Each hop carries a balance stability check: .
- If any step faults (stepping on line or foot drop): `Fault`. Turn ends; remains unchanged.
R4. Stone Retrieval & Return:
- On return traversal, when occupying node adjacent to , agent executes `retrieve_stone()`.
- Balance check on retrieval: .
- Agent hops out of court across baseline.
R5. Level Advancement:
- If toss, traversal, retrieval, and exit are all executed without fault: .
- Agent immediately begins next attempt at (until committing a fault or reaching win condition).
R6. Victory Condition: First agent to successfully complete level wins the match.
## Edge cases
- **Tie at the end condition:** Not applicable; turns and level clearances are sequential.
- **A player with no legal move:** Action choices (throw, hop, retrieve) are universally available.
- **Repetition / cycles:** Progress levels are non-decreasing (); expected progress per turn strictly positive, guaranteeing termination.
- **Simultaneous claims on the same resource or position:** Turns on the court are strictly single-agent sequential.
- **Player elimination mid-round; turn order repair:** No eliminations; turn rotates cyclically among all agents.
- **Resource exhaustion:** 1 stone and 1 court grid; infinite reuse.
- **Termination guarantee:** Monotonically non-decreasing progress vector guarantees eventual termination.
## State representation
- **Persistent state:** Progress level vector , current active agent index , winner ID.
- **Per-attempt state:** Stone position coordinate, current traversed node in , fault status.
- **Observable information:** Fully observable state. All agent progress levels and court actions are public.
## Action space
- `toss_stone(target_level, throw_effort)`: Float effort .
- `hop_step(node_id, hop_type)`: Execute single, straddle, or turnaround hop.
- `retrieve_stone()`: Execute retrieval action.
## Playability notes
- **Single-player-vs-AI:** Highly playable as a solitaire precision and risk-management challenge.
- **Group games ():** Standard schoolyard round-robin rotation.
- **Physical-skill games:** Hopping balance, ankle stabilization, and chalk-line avoidance are abstracted into balance checks.
- **What is lost in the adaptation:** Physical pavement scrape on shoe soles, wind effects on the chalk stone, and playground sun.
## Implementation hints
- Model the court graph nodes with predefined attributes (`single`, `pair_left`, `pair_right`, `heaven`).
- Suggested first milestone: Implement deterministic level traversal and stone retrieval before adding stochastic fault probabilities.
Download as JSON
Download the full game corpus entry for this game as structured JSON.
Download JSONCite this page
Austrian hopscotch (Himmel und Hölle) (Austria). (n.d.). Games of Countries. https://gamesofcountries.com/games/at-austria/tempelhuepfen
@misc{gamesofcountries-at-austria-tempelhuepfen,
title = {Austrian hopscotch (Himmel und Hölle) (Austria)},
year = {n.d.},
publisher = {Games of Countries},
url = {https://gamesofcountries.com/games/at-austria/tempelhuepfen}
}