Formal Specification
Apples (Greek Dodgeball) — Formal Specification
Greece · ball-team · Confidence: high
← Back to game pageImplementation Suitability
Suitability: engine-readyFidelity: discretizedGap-fills: 2
# Mila — AI-optimized specification
## General idea
An asymmetric, discrete dodgeball elimination game on a 2D corridor grid. Two throwers at opposite ends pass and target central dodgers. Dodgers can choose to evade or attempt high-risk aerial catches to earn banking "apple" tokens (extra lives) or resurrect eliminated teammates. When one dodger remains, a countdown phase initiates.
## Formal model
- **Abstraction taken:** Court discretized into a 2D grid (, e.g. ). Throwers occupy end baselines and . Dodgers occupy the interior corridor . Ball trajectory is modeled as discrete line vectors with flight time and hit probabilities.
- **Player/agent count:** 2 Throwers () and Dodgers (, default ).
- **Turn model:** Sequential throw events. Between throws, all active dodgers position themselves simultaneously on the grid.
## Formal rules
R1. State tracking: Per dodger : `(x, y)`, `lives` (starts at 1), `status` . Active thrower .
R2. Thrower Actions:
- Active thrower holding ball selects target coordinate and throw type .
- Ball travels along line path from to opposing baseline.
R3. Dodger Reaction & Hit Resolution:
- If ball trajectory passes through cell of active dodger :
- Dodger chooses reaction: `dodge()` or `attempt_catch()`.
- If `dodge()`: Hit check: .
- If hit: `D_i.lives -= 1`. If `D_i.lives == 0`, `D_i.status = eliminated`.
- If `attempt_catch()`:
- [gap-fill] Catch probability: .
- If catch succeeds: `D_i.lives += 1` ("Apple gained"). Dodger may immediately spend 1 life to revive one eliminated teammate (`status = active`).
- If catch fails: Dodger is struck directly (`D_i.lives -= 1`).
R4. Turn Transition:
- Ball reaches opposite baseline; the other thrower acquires the ball ().
R5. Final Survivor Countdown:
- When exactly 1 active dodger remains (`active_count == 1`):
- A countdown counter `countdown_throws = 10` is initialized.
- Each subsequent throw successfully dodged decrements `countdown_throws -= 1`.
- If `countdown_throws == 0`: Final survivor wins match; all teammates are restored to active status.
- If survivor is hit and has 0 extra lives before reaching 0: Throwers win the round.
R6. [gap-fill] Turn Limit: Match capped at 200 total throws. If throwers fail to eliminate all dodgers or trigger the countdown win within 200 throws, Dodgers win on points.
## Edge cases
- Tie at the end condition: Not applicable — countdown resolution or total elimination produces a strict binary winner.
- A player with no legal move: Waiting / dodging is always legal.
- Repetition / cycles: Bounded by R6 (hard 200-throw ceiling).
- Simultaneous claims on the same resource or position: Dodgers may share grid cells; if ball intersects multiple dodgers in the same cell, the front-most dodger resolves the interaction first.
- Player elimination mid-round; turn order repair: Eliminated dodgers leave the central corridor; when revived via an Apple, they re-enter at the center cell .
- Resource exhaustion: Extra lives are non-negative integers; ball is conserved.
- Termination guarantee: Enforced by finite countdown (10 throws) and 200-throw overall ceiling.
## State representation
- Persistent state:
- `dodgers`: Array of structs: `[x, y, lives, status]`.
- `active_thrower`: 0 or 1.
- `countdown_remaining`: Integer (starts at -1, sets to 10 when 1 dodger left).
- `total_throws`: Integer counter.
- Per-throw ephemeral state:
- `ball_trajectory`: Ray vector from to .
- Observable information: Fully observable.
## Action space
- Thrower: `throw_strike(target_x, target_y)`, `pass_ball()`.
- Dodger: `move(dx, dy)`, `dodge()`, `attempt_catch()`, `spend_apple_revive(teammate_id)`.
## Playability notes
- Single-player-vs-AI: Highly playable as a risk/reward dodgeball simulation. A human dodger decides when to risk catching for extra lives.
- Group games (n>4): Scales naturally for dodgers.
- Physical-skill games: Physical ducking and catching translated into stochastic probability trees conditioned on agent agility and timing.
- What is lost: Physical adrenaline, stinging ball impacts, and playground roar.
## Implementation hints
- Implement as a discrete raycast collision step.
- Dodger heuristic: If `lives > 1`, take higher risks attempting catches to generate teammate revivals; if `lives == 1`, prioritize pure dodging.
Download as JSON
Download the full game corpus entry for this game as structured JSON.
Download JSONCite this page
Apples (Greek Dodgeball) (Greece). (n.d.). Games of Countries. https://gamesofcountries.com/games/gr-greece/mila
@misc{gamesofcountries-gr-greece-mila,
title = {Apples (Greek Dodgeball) (Greece)},
year = {n.d.},
publisher = {Games of Countries},
url = {https://gamesofcountries.com/games/gr-greece/mila}
}