Skip to main content
Formal Specification

Five Stones / Jacks — Formal Specification

Ireland · dexterity-small · Confidence: low

← Back to game page

Implementation Suitability

Suitability: adaptation-requiredFidelity: probabilistic-proxyGap-fills: 1
# Cúig Chloch — AI-optimized specification ## General idea A progressive dexterity game where players race through 6 sequential figures of increasing mechanical difficulty, tossing a single stone aloft while scooping precise counts of ground stones without touching adjacent pieces. Strategy involves scatter placement optimization and selecting risk-managed snatch trajectories under tight airborne time windows. ## Formal model - **Abstraction taken:** Stone positions on the flagstone are modeled as 2D coordinates `p_1..p_5 ∈ [0, 30] × [0, 30]` (cm). Physical dexterity (toss height, snatch speed, avoidance of unselected stones) is parameterized by agent dexterity attribute `DEX ∈ [0.0..1.0]`. The probability of successfully completing a grab without faulting depends on stone spacing and grab cluster count: `P(success) = f(DEX, cluster_tightness, level_difficulty)`. - **Player/agent count:** 2 competing agents (`P1`, `P2`). - **Turn model:** Turn-based round sequence where an agent continues executing sub-actions within their active level until a fault occurs or the level completes. ## Formal rules R1. Game state setup: Levels are indexed `1..6` (`Ones`, `Twos`, `Threes`, `Fours`, `Gate`, `BackOfHand`). Each agent tracks `current_level[P_i] = 1` and `sub_step[P_i] = 0`. Turn index starts with `P1`. R2. Scatter action: At the start of an attempt, the active agent executes `scatter_stones()`, generating 5 coordinates `p_1..p_5` on the surface. Agent selects 1 stone as `Jack`. R3. Level execution: - For `current_level == 1` (`Ones`): 4 sequential single-stone snatches required. - For `current_level == 2` (`Twos`): 2 sequential 2-stone snatches required. - For `current_level == 3` (`Threes`): 1 3-stone snatch followed by 1 1-stone snatch. - For `current_level == 4` (`Fours`): 1 4-stone simultaneous snatch. - For `current_level == 5` (`Gate`): 4 sequential gate-flicks + 1 group snatch. - For `current_level == 6` (`BackOfHand`): 1 balance-toss test. R4. Snatch attempt resolution: - Active agent executes `attempt_snatch(target_stone_ids)`. - Success probability: `P = DEX_i * (1.0 - 0.1 * (Level - 1)) * Spacing_Modifier`. - If random draw `U(0,1) ≤ P`: `SUCCESS`. Sub-step increments. If all sub-steps in the level complete, `current_level[P_i]` increments by 1. - If `U(0,1) > P`: `FAULT`. Agent's turn terminates immediately. The agent retains `current_level[P_i]` for their next turn. R5. Turn alternation: Upon a fault or completion of level 6, the active turn passes to the other agent. R6. Victory condition: - The first agent to successfully complete Level 6 wins the game immediately. - [gap-fill] Turn limit: If neither agent clears Level 6 within 30 turns, the agent at the highest `current_level` (and highest `sub_step`) wins. ## Edge cases - Tie at the end condition: Evaluated under turn cap by highest `(current_level, sub_step)`; if exactly identical, resolved as a draw. - A player with no legal move: Not applicable; an active player always has valid target subsets corresponding to the active level requirements. - Repetition / cycles: Governed by the 30-turn maximum match cap. - Simultaneous claims on the same resource or position: Turns are strictly sequential; stone coordinates reset per attempt. - Player elimination mid-round: In 2-player match play, forfeit awards victory to the remaining competitor. - Resource exhaustion: Exactly 5 stones are tracked; no stone loss is simulated. - Termination guarantee: Monotonically progressing turn counter capped at 30 rounds guarantees termination. ## State representation - Persistent state: Progression status `current_level[P_i]`, `sub_step[P_i]`, turn counter (1..30), active agent ID. - Per-player state: Skill parameter `DEX_i`, fault history. - Per-turn ephemeral state: Scattered stone coordinates `[(x_1, y_1), ..., (x_5, y_5)]`, active Jack ID, remaining ground stones. - Observable information: Full visibility of stone coordinates and competitor level progress. ## Action space - `scatter_stones()`: Distribute 5 stones across the playing grid. - `attempt_snatch(target_stone_ids: list)`: Execute toss-and-grab maneuver on specified stone indices. ## Playability notes - Single-player-vs-AI: Functions as a race optimization against stochastic fault rates. - Group games (n>4): Easily supports 2 to 6 players in turn rotation. - Physical-skill games: High-frequency kinesthetic catching and fine motor accuracy modeled as parameterized Bernoulli trials. - What is lost: The sharp tactile click of polished quartz stones and the feeling of catching stones on the knuckles. ## Implementation hints Treat level progression as a deterministic finite-state machine `L1 -> L2 -> ... -> L6 -> Victory`, triggered by stochastic transition checks per snatch action.

Download as JSON

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

Download JSON
Cite this page

Five Stones / Jacks (Ireland). (n.d.). Games of Countries. https://gamesofcountries.com/games/ie-ireland/cuig-chloch

@misc{gamesofcountries-ie-ireland-cuig-chloch,
  title = {Five Stones / Jacks (Ireland)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/ie-ireland/cuig-chloch}
}