Skip to main content
Formal Specification

Indonesian Jacks / Bekel Ball — Formal Specification

Indonesia · dexterity-small · Confidence: low

← Back to game page

Implementation Suitability

Suitability: adaptation-requiredFidelity: probabilistic-proxyGap-fills: 3
# Bekelan — AI-optimized specification ## General idea A turn-based sequential dexterity race where agents progress through a ladder of manipulative stages (pickups, 4-face orientation flips, and grand sweeps) using a bouncing ball and metal jacks. Physical hand speed and spatial precision during the ball bounce are modeled via a probabilistic execution resolver parameterized by stage difficulty and agent dexterity attributes. ## Formal model - **Abstraction taken:** The continuous physical ball bounce (apex, bounce timing, hand sweep) is abstracted into a discrete action attempt with probability P(success)=f(action_type,substage,skill). - **Player/agent count:** 2 to 4 agents in a fixed round-robin rotation. - **Turn model:** Sequential. An active agent continues making successive action attempts within their turn until committing a fault (*kobong*) or winning the game. ## Formal rules R1. Setup: N=6 jacks are scattered. Each agent initializes progress state at `(stage=1, substage=1)`. R2. Stage definition: - Stages 1 to 5 correspond to: (1) Numerical Pickups (*Mi*), (2) Concave (*Pit*), (3) Convex (*Ro*), (4) Smooth (*Cin*), and (5) Dotted (*Peng*). - Sub-stages within Stage S∈[1..5] iterate k∈[1..6] (handling k jacks per bounce). - Stage 6 (*Nas*) requires a complete sweep in a single bounce [gap-fill]. R3. Attempt execution: - Active agent chooses action `attempt_substage(S, k)`. - Outcome ω∈{SUCCESS,FAULT} is sampled from Bernoulli distribution with P(SUCCESS)=max⁡(0.05,skill−0.08×(S+k×0.5)) [gap-fill]. R4. State transition: - If `SUCCESS`: Progress advances to next sub-stage: if k<6, k←k+1; if k=6, S←S+1,k←1. - If `FAULT`: Progress is preserved (checkpointed at current S,k); the agent's turn ends immediately. R5. Turn rotation: Upon a fault, active player index increments: active_idx←(active_idx+1)(modnum_agents). R6. Win condition: The first agent to successfully complete Stage 6 (S=6,k=1) wins the game immediately. ## Edge cases - Tie at the end condition: Not applicable; turns are strictly sequential, so one agent reaches the win state first. - A player with no legal move: Not applicable; the required substage attempt is always available. - Repetition / cycles: Bounded by monotonic non-decreasing checkpoint progress (S,k) per agent. - Simultaneous claims on the same resource or position: Not applicable; only one agent manipulates pieces per turn. - Player elimination mid-round: If an agent disconnects/forfeits, their index is removed from the rotation array without disturbing the remaining agents' saved checkpoints. - Resource exhaustion: Not applicable; the fixed set of jacks and ball are reused indefinitely. - Termination guarantee: Since P(SUCCESS)≥ϵ>0 for all valid stages, every agent has a strictly positive probability of advancing, guaranteeing almost-sure termination. ## State representation - Persistent state: - `agents`: array of objects `{id, skill_rating, stage, substage}`. - `active_agent_idx`: integer 0..num_agents−1. - `winner`: nullable agent ID. - Per-turn ephemeral state: - `last_attempt_success`: boolean. - Observable information: Fully observable (all agents' stages and substages are public knowledge). ## Action space - `attempt_substage()`: Execute current required manipulation stage with stochastic resolution. - [gap-fill] select_risk_profile(risk_factor)`: Optional parameter ∈[0.8,1.2] scaling speed vs safety. ## Playability notes - Single-player-vs-AI: Excellent as a solo time-attack ladder or 1v1 turn-based race against a bot. - Group games (n>4): Naturally reduces to 2 agents without altering any rule or probability mechanic. - Physical-skill games: Physical eye-hand coordination is modeled via a decreasing logistic curve over stage complexity. - What is lost in the adaptation: The visual and auditory delight of brass jacks clinking against a tiled floor while tracking a high-velocity bouncing ball is replaced by statistical checks. ## Implementation hints Extremely clean finite-state machine with (5×6+1)=31 discrete progress nodes. First milestone: Implement single-agent ladder state progression with mock RNG before connecting multi-agent turn rotation.

Download as JSON

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

Download JSON
Cite this page

Indonesian Jacks / Bekel Ball (Indonesia). (n.d.). Games of Countries. https://gamesofcountries.com/games/id-indonesia/bekelan

@misc{gamesofcountries-id-indonesia-bekelan,
  title = {Indonesian Jacks / Bekel Ball (Indonesia)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/id-indonesia/bekelan}
}