Skip to main content
Formal Specification

Czech Football Tennis (Futnet) — Formal Specification

Czechia · ball-team · Confidence: high

← Back to game page

Implementation Suitability

Suitability: engine-readyFidelity: discretizedGap-fills: 1
# Nohejbal — AI-optimized specification ## General idea A discrete rally-based team sport model where two opposing squads of agents navigate a grid-partitioned court to return a ball across a central barrier. Agents execute receptions, sets, and attacking smashes under strict touch caps (maximum 3 team touches) and ground bounce limitations (maximum 1 bounce per possession). ## Formal model - **Abstraction taken:** The 18 × 9 m court is discretized into a 6 × 6 cell spatial grid (3 × 6 cells per side divided by the net). Continuous ballistic flight and foot touches are represented as discrete trajectory transitions parameterized by agent kicking/heading attributes and positional positioning. - **Player/agent count:** 2 teams of N agents (N∈{1,2,3}, default triples N=3). - **Turn model:** Real-time ticked state machine / discrete rally sequence with micro-ticks per ball transit. ## Formal rules R1. Setup: Court divided into Team 0 (cells [0..2,0..5]) and Team 1 (cells [3..5,0..5]). Net lies between x=2 and x=3. Set target = 10 points. Best of 3 sets. R2. Service: Serving agent kicks from baseline (x=0 or x=5) across net into receiver half. Ball must land inside opponent bounds. R3. Team possession cycle: - Counter `team_touches` initialized to 0; `bounce_count` initialized to 0. - Ball state updates: when ball hits ground in active half, `bounce_count += 1`. - If `bounce_count > 1` before a legal touch/return: Rally ends, opposing team scores 1 point. - If `team_touches > 3` before clearing net: Rally ends, opposing team scores 1 point. R4. Agent touch constraints: - An agent in cell (x,y) can execute a touch if ball is in (x,y). - Consecutive touches by the identical agent are prohibited in N≥2. - Actions: `RECEIVE`, `SET`, `SMASH`, `DEFEND_BLOCK`. R5. Net crossing: When ball trajectory crosses from x=2 to x=3 (or vice versa), possession switches to defending team; `team_touches = 0`, `bounce_count = 0`. R6. Scoring: Winner of rally increments `score[team] += 1`. Service passes to the team that scored the point. R7. Set and match win conditions: First team to reach 10 points with a lead of ≥2 points wins the set (hard cap at 12 points: at 11-11, next point wins 12-11). First team to win 2 sets wins the match. R8. [gap-fill] Boundary line ambiguity: If a simulated ball impact lands within 0.05 m of the perimeter line, it is resolved as IN (favor of attacker). ## Edge cases - Tie at the end condition: Bounded by the hard ceiling of 12 points per set; no infinite deuce cycles possible. - A player with no legal move: Not applicable; positional movement and intercept attempts are always legal. - Repetition / cycles: Bounded because every rally is strictly bounded by bounce/touch limits (P(unforced error)>0 per exchange), and points accumulate monotonically to 10–12. - Simultaneous claims on the same resource or position: If two teammates enter the same cell to touch the ball, priority resolves to the designated role (setter > attacker) or lowest agent ID; collision penalty slightly degrades shot accuracy. - Player elimination mid-round: If an agent disconnects, team plays shorthanded (N−1); rotation repairs automatically. - Resource exhaustion: Not applicable; balls are not consumed. - Termination guarantee: Guaranteed by point ceiling per set (max 23 points per set) and match set cap (max 3 sets). ## State representation - Persistent state: `set_scores: list[tuple[int, int]]`, `current_set: int`, `server_team: {0, 1}`, `current_points: [int, int]`. - Ephemeral rally state: `ball_pos: tuple[float, float, float]`, `ball_velocity: tuple[float, float, float]`, `active_team: {0, 1}`, `team_touches: int`, `bounce_count: int`, `last_touch_agent_id: int`, `agent_positions: dict[int, tuple[int, int]]`. - Observable information: Fully observable (all positions, scores, and ball trajectories are public). ## Action space - `move_to(cell_x: int, cell_y: int)`: Target coordinate inside team zone. - `execute_touch(action_type: {RECEIVE, SET, SMASH, CLEAR}, target_cell: tuple[int, int], power: float)`: Parameterized touch. ## Playability notes - Single-player-vs-AI: Natural; human commands 1 agent (in 1v1 singles) or controls squad tactics against AI. - Group games (n>4): Supported via team roster substitutions and rotation. - Physical-skill games: Kick precision, spike power, and jump timing are modeled as skill parameters μskill modulating shot error covariance. - What is lost: Acrobatic foot-volley biomechanics (e.g. overhead scissors kick / *nůžky*) are mapped to discrete smash parameters. ## Implementation hints Medium complexity. Structuring the game loop as a 2-layer state machine (Rally Loop inside Match Loop) makes implementation straightforward. Suggested first milestone: implement a 1v1 discrete rally simulator with deterministic trajectory bounces before expanding to 3v3 team positioning.

Download as JSON

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

Download JSON
Cite this page

Czech Football Tennis (Futnet) (Czechia). (n.d.). Games of Countries. https://gamesofcountries.com/games/cz-czechia/nohejbal

@misc{gamesofcountries-cz-czechia-nohejbal,
  title = {Czech Football Tennis (Futnet) (Czechia)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/cz-czechia/nohejbal}
}