Skip to main content
Formal Specification

Shove Ha'penny (Table Coin-Sliding Game) — Formal Specification

United Kingdom · dexterity-small · Confidence: medium

← Back to game page

Implementation Suitability

Suitability: engine-readyFidelity: probabilistic-proxyGap-fills: 1
# Shove Ha'penny — AI-optimized specification ## General idea A turn-based tabletop game where agents shove five coins along a low-friction track into nine segmented horizontal beds. Points accumulate only when a coin rests strictly inside a bed without line overlap. The core strategic tension lies in managing over-scoring (which gifts points to the opponent) and using later coins to cannon earlier coins into legal beds. ## Formal model - **Abstraction taken:** The 1D board axis `y in [0.0, 24.0]` inches is divided into 9 scoring beds of width `1.25` in, with line boundaries at `y_k = 4.0 + k * 1.25` for `k in 0..9`. A coin of diameter `1.0` in scores in Bed `k` iff its final resting center `y_center` satisfies `y_k + 0.5 < y_center < y_{k+1} - 0.5`. Continuous frictional sliding and 1D elastic collisions are resolved per shove. - **Player/agent count:** 2 agents (`P1`, `P2`). - **Turn model:** Alternating turns. Each turn consists of 5 consecutive coin shoves. ## Formal rules R1. **Setup:** Both agents initialize their score sheets with 0 points across all 9 beds: `Score_P1 = [0]*9`, `Score_P2 = [0]*9`. R2. **Turn Execution:** The active agent shoves 5 coins sequentially. For coin `i in 1..5`, the agent chooses an initial impulse: - `shove(impulse: float in [1.0, 10.0])` R3. **Collision & Resting Resolution:** - Each coin glides along the board subject to dynamic friction. - If a sliding coin strikes a stationary coin already on the board, a 1D elastic collision updates both positions. - Coins exiting the far board boundary (`y > 20.0`) fall into the ditch and are removed. R4. **Scoring Evaluation at Turn End:** Once all 5 coins come to rest, each coin's position is evaluated: - If a coin lies entirely within Bed `k` (no line touch): - If `Score_active[k] < 3`: `Score_active[k] += 1`. - If `Score_active[k] == 3`: - If `Score_opponent[k] < 3`: `Score_opponent[k] += 1` (gifted point). - If `Score_opponent[k] == 3`: void (no score change). R5. **End Condition & Winning Rule:** - An agent wins immediately upon having `Score[k] == 3` for all `k in 0..8` (total 27 points). - [gap-fill] Anti-gift winning restriction: If an opponent's over-shove would award the 27th point to the passive agent, that 27th point is ignored; the winning point must be scored during the agent's own active turn. R6. **Board Reset:** At the end of the turn, all 5 coins are retrieved and cleared from the board before the next agent plays. ## Edge cases - **Tie at the end condition:** Not applicable; turns are sequential and the first player to achieve 27 points wins immediately. - **A player with no legal move:** Not applicable; `shove()` is always legal. - **Repetition / cycles:** Bounded because points accumulate monotonically (scores never decrease) towards the ceiling of 27. - **Simultaneous claims on the same resource:** Not applicable; sequential turns. - **Player elimination mid-round:** Not applicable; 2-agent closed system. - **Resource exhaustion:** Exactly 5 coins per turn, fully reusable across rounds. - **Termination guarantee:** Guaranteed by monotonic accumulation of points in finite integer state space `[0..3]^9` per player. ## State representation - **Persistent state:** `Score_P1: array[9] of int (0..3)`, `Score_P2: array[9] of int (0..3)`, `active_player: int (1 or 2)`. - **Per-turn ephemeral state:** `coins_on_board: list of float (y-positions)`, `coins_remaining: int (0..5)`. - **Observable information:** Fully observable state. ## Action space - `shove(impulse)`: Float value representing force applied to the coin. ## Playability notes - **Single-player-vs-AI:** Excellent 1v1 playability; AI computes target impulse distributions and accounts for cannoning clusters. - **Group games reduction:** Naturally 1v1 (or 2v2 alternating pairs). - **Physical-skill games:** Physical friction and impulse precision modeled with Gaussian noise: `actual_impulse ~ Normal(declared_impulse, sigma)`. - **What is lost in the adaptation:** The physical sensation of smoothing the board with chalk and feeling the weighted rim of the halfpenny. ## Implementation hints - Discrete 1D physics engine with 5 moving discs takes under 50 lines of code. - Branching factor is 1 continuous parameter per shove (can be discretized to 20 force steps). - First milestone: Implement 1D sliding simulation with line-check validation and play an automated match between random-force agents.

Download as JSON

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

Download JSON
Cite this page

Shove Ha'penny (Table Coin-Sliding Game) (United Kingdom). (n.d.). Games of Countries. https://gamesofcountries.com/games/gb-united-kingdom/shove-hapenny

@misc{gamesofcountries-gb-united-kingdom-shove-hapenny,
  title = {Shove Ha'penny (Table Coin-Sliding Game) (United Kingdom)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/gb-united-kingdom/shove-hapenny}
}