Skip to main content
Formal Specification

Five Pebbles — Formal Specification

Nepal · dexterity-small · Confidence: low

← Back to game page

Implementation Suitability

Suitability: adaptation-requiredFidelity: probabilistic-proxyGap-fills: 1
# Gatta — AI-optimized specification ## General idea Gatta is a multi-stage sequential dexterity race where agents attempt to complete 6 progressively difficult stone manipulation levels (1s, 2s, 3s, 4s, Bridge, Back-of-Hand Catch) with 5 pebbles. The AI specification models spatial scattering and hand-eye pickup windows. ## Formal model - **Abstraction taken:** Physical hand scooping and tossing are discretized into 6 sequential stages (L1…L6). Each stage attempt computes success probability as a function of the spatial scatter distance between pebbles and player dexterity rating. - **Player/agent count:** 1 to n agents (typically 2 to 4). - **Turn model:** Sequential turns. An agent continues clearing levels until a fumble occurs, retaining completed stage progress for future turns. ## Formal rules R1. State Progression: Every agent tracks current level Li∈{1,2,3,4,5,6} (initial Li=1). R2. Stage Definitions: - L1 (Ek-Gatte): Pick 4 single pebbles individually while Daali is airborne. - L2 (Dui-Gatte): Pick 2 pairs of pebbles. - L3 (Tin-Gatte): Pick 1 group of 3, then 1 single. - L4 (Char-Gatte): Scatter all 4, then scoop all 4 in one throw. - L5 (Pul / Bridge): Flick 4 pebbles through an arched hand aperture. - L6 (Chepta): Catch all 5 pebbles on back of hand, then snatch downward. R3. Execution Resolution: - [gap-fill] For stage Lk, probability of successful completion without foul is P(Lk)=exp⁡(−λ⋅k) where λ is error rate. - Sample u∼Uniform(0,1). - If u≤P(Lk): Stage Lk is CLEARED →Li←Lk+1. The agent immediately attempts the next stage. - If u>P(Lk): FOUL occurs → turn ends immediately. Progress is saved at Lk. R4. Turn Passing: When a foul occurs, turn rotates to the next agent. R5. Win Condition: The first agent to clear stage L6 wins the match immediately. ## Edge cases - Tie at the end condition: Not applicable — strictly sequential turns ensure one agent clears L6 first. - A player with no legal move: Not applicable — stage attempt action is always available. - Repetition / cycles: Bounded by monotonic non-decreasing stage progress (Li≤6). - Simultaneous claims on the same resource or position: Turns are strictly sequential. - Player elimination mid-round: Not applicable — race to complete 6 stages. - Resource exhaustion: Fixed 5 pebbles throughout. - Termination guarantee: Non-zero stage completion probability per turn ensures absorbing state at L6. ## State representation - `agent_levels`: Array [L1,…,Ln] where Li∈[1,7] (7≡Completed). - `current_agent`: Integer ∈[0,n−1]. - `turn_attempts_in_round`: Integer. ## Action space - `attempt_stage()`: Execute attempt for current stage Li. ## Playability notes - Single-player-vs-AI: Natural as a solitaire speed challenge or head-to-head race against an AI opponent. - Group games (n>4): Extends smoothly across any number of agents. - Physical-skill games: Multi-pebble grasping dexterity is modeled via calibrated probability curves. - What is lost in the adaptation: The tactile micro-sensory control of catching pebbles on the knuckles. ## Implementation hints Very low state complexity (single integer level per agent). Ideal introductory simulation for state machine design. First milestone: implement state transitions L1→L6 and simulate win-distribution curves.

Download as JSON

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

Download JSON
Cite this page

Five Pebbles (Nepal). (n.d.). Games of Countries. https://gamesofcountries.com/games/np-nepal/gatta

@misc{gamesofcountries-np-nepal-gatta,
  title = {Five Pebbles (Nepal)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/np-nepal/gatta}
}