Skip to main content
Formal Specification

Skipping stones / Stone skimming — Formal Specification

Sweden · dexterity-throw · Confidence: high

← Back to game page

Implementation Suitability

Suitability: adaptation-requiredFidelity: probabilistic-proxyGap-fills: 5
# Kasta smörgås — AI-optimized specification ## General idea A traditional Scandinavian water-skimming dexterity game where players select flat stones and pitch them sidearm at shallow angles across calm water to maximize the count of consecutive surface skips before sinking. The game models the hydrodynamic interaction between stone geometry, rotational spin stabilization, entrance angle, and water surface tension. Contested as a multi-round competitive challenge. ## Formal model - **Abstraction taken:** Continuous physical aerodynamics and fluid surface collisions are replaced by a parameterized discrete hydrodynamic bounce sampler. An agent chooses a stone profile (m,r,f) and delivery vectors (speed v,angle θ,spin ω). A step-by-step bounce decay function evaluates whether each consecutive water impact rebounds into the air or sinks, outputting a discrete integer skip count K≥0. - **Player/agent count:** 1 to N agents (benchmark N=2: Player 1 and Player 2). - **Turn model:** Strictly sequential rounds; players alternate throwing one stone per turn. ## Formal rules R1. **Match Structure:** The match consists of R=5 rounds [gap-fill]. In each round, players throw one stone in turn. R2. **Stone Selection:** - On each throw, the active player chooses a stone from an available pool with properties: mass m∈[50,200]g, radius r∈[3,6]cm, and flatness coefficient f∈[0.5,1.0] [gap-fill]. R3. **Throw Execution:** - The player specifies launch parameters: release velocity v0∈[10,30] m/s, attack angle θ0∈[10∘,35∘], and spin rate ω0∈[10,50] rad/s. - An agent's execution error is added: (v,θ,ω)∼𝒩((v0,θ0,ω0),Σskill). R4. **Hydrodynamic Bounce Loop:** - The simulation initializes bounce counter k=0, current velocity v=v0, angle θ=θ0, spin ω=ω0. - While v>vmin⁡=3.0 m/s and ω>ωmin⁡=5.0 rad/s: - Rebound probability is evaluated: P(bouncek)=max⁡(0,1−|θ−θoptimal|15∘)⋅min⁡(1,f⋅v2Clift)⋅(ωω0)0.5 [gap-fill]. - A random sample u∼U(0,1) is drawn. If u≤P(bouncek), the bounce succeeds: k←k+1. - Kinetic decay: v←v⋅γv, ω←ω⋅γω, θ←θ+Δθ, with γv=0.75,γω=0.80,Δθ=+2.5∘ [gap-fill]. - If u>P(bouncek), the stone sinks (pierces the surface); the loop terminates. - Final score for the throw is k skips. R5. **Round Scoring & Victory:** - The player's single highest skip score across all R=5 rounds is recorded as their final score (*flest i rad* format). - The player with the highest single-throw skip count wins the match. - [gap-fill] Tie-break: If top skip scores are identical, the player's cumulative skips across all 5 rounds breaks the tie. ## Edge cases - Tie at the end condition: Resolved by cumulative skips across all 5 rounds per R5; if still tied, a 1-throw sudden-death overtime is played. - A player with no legal move: Not applicable — throwing action is always available. - Repetition / cycles: The bounce loop strictly decays velocity (v→0), guaranteeing that every single throw terminates in at most 30 iterations. - Simultaneous claims on the same resource or position: Not applicable — throws are strictly sequential. - Player elimination mid-round: If a player disconnects, their remaining throws are scored as 0. - Resource exhaustion (pieces, tokens, space, time): Stone pool is renewed each throw; round count is fixed at R=5. - Termination guarantee: Each individual throw terminates in finite loop steps (k<30), and each match terminates after exactly N×R throws. ## State representation - **Persistent state:** - `round`: integer ∈[1,R]. - `player_scores`: map of player ID →{best_skips:int,cumulative_skips:int,history:list[int]}. - `current_player_index`: integer. - **Per-turn ephemeral state:** - `selected_stone`: `(m, r, f)`. - `executed_throw`: `(v, theta, omega)`. - `current_skips`: integer. - **Observable information:** - Fully observable: Water surface conditions (calmness factor), all past throw outcomes, and current scoreboards are public. ## Action space - `select_stone(stone_id)`: choose stone geometry. - `throw(velocity, angle, spin)`: float parameters v∈[10,30],θ∈[10,35],ω∈[10,50]. ## Playability notes - Single-player-vs-AI: Natural and highly engaging — acts as a precision physics simulation where players optimize release parameters against water friction models. - Group games (n>4): Generalizes effortlessly to any N players via standard turn rotation. - Physical-skill games: Physical wrist whip, sidearm trajectory, and fingertip spin are formalized as optimal parameter tuning with execution variance governed by agent skill variance Σskill. - What is lost in the adaptation: The tactile sensation of searching for cold, smooth slate stones along a Baltic beach, the pleasant acoustic sound of stone clapping across water, and Swedish summer lakeside scenery. ## Implementation hints Low complexity. The core engine is a closed-form stochastic loop requiring minimal state. The physics parameters can be calibrated to yield typical human distributions (e.g. beginner: 3–6 skips; expert: 12–20 skips; world record: 88). First milestone: implement the single-throw bounce loop and plot skip count versus release angle θ to confirm an optimal sweet spot around 20∘.

Download as JSON

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

Download JSON
Cite this page

Skipping stones / Stone skimming (Sweden). (n.d.). Games of Countries. https://gamesofcountries.com/games/se-sweden/kasta-smorgas

@misc{gamesofcountries-se-sweden-kasta-smorgas,
  title = {Skipping stones / Stone skimming (Sweden)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/se-sweden/kasta-smorgas}
}