Skip to main content
Formal Specification

Greased Bamboo Pole Climbing — Formal Specification

Philippines · festival-ritual · Confidence: low

← Back to game page

Implementation Suitability

Suitability: engine-readyFidelity: abstractedGap-fills: 4
# Palo Sebo — AI-optimized specification ## General idea A sequential vertical climbing contest where N agents take turns attempting to ascend a 10-meter vertical pole. The pole is initialized with high surface grease levels across 10 vertical segments (H∈[0..10]). Each climber's attempt incurs progressive stamina expenditure and stochastic slippage checks; however, every attempt permanently removes grease from the segments climbed, monotonically reducing difficulty for subsequent attempts until a climber successfully reaches H=10. ## Formal model - **Abstraction taken:** Pole is discretized into 10 vertical 1-meter segments s∈[0..9]. Each segment has a dynamic grease level G(s)∈[0.0,1.0]. A climber possesses stamina E∈[0.0,1.0]. Climbing a segment consumes stamina and tests a stochastic grip check P(slip)=f(G(s),E,skill). - **Player/agent count:** 3 to 10 agents (P0..Pk−1) in sequential queue rotation. - **Turn model:** Strictly sequential single-attempt climbing trials. ## Formal rules R1. Setup: - Pole segments s∈[0..9] initialized with maximum grease: G(s)=1.0 for all s. - Agent queue is fixed: Q=[P0,P1,…,Pk−1]. - Global state `prize_claimed = false`. R2. Climbing Attempt Progression: - Active climber Pi starts at height h=0.0 with stamina E=1.0. - On each upward step s=⌊h⌋: - Climber selects action `climb_step(effort_level)` where effort u∈[1,3] [gap-fill]: - Stamina cost: ΔE=−0.06×u. - Height gain: Δh=0.4×u. - Grease removal: G(s)←max⁡(0.05,G(s)−0.15×u) (pole state permanently updated) [gap-fill]. - Slippage check sampled: - P(slip)=min⁡(0.95,max⁡(0.02,G(s)×(1.5−E)×(1.0−0.5×skill))). - If slippage occurs (`slip == true`) or E≤0.0: - Climber slides to base (h←0.0); attempt terminates (`attempt_failed = true`). - Otherwise, h←h+Δh. R3. Peak Reach & Victory: - If climber reaches h≥10.0 without slipping: - `prize_claimed = true`. - Climber Pi is declared the winner immediately (+100 points). - Match terminates. R4. Queue Rotation: - If attempt fails and h<10.0, turn passes to the next agent in queue Q. - Queue loops repeatedly (P0→P1→⋯→Pk−1→P0) until the prize is claimed or max rounds Rmax⁡=10 full rotations elapse [gap-fill]. ## Edge cases - Tie at the end condition: Inapplicable; first agent to reach h≥10.0 wins immediately; if no agent reaches the top after Rmax⁡, the agent who reached the maximum height hmax⁡ across all attempts is declared the winner [gap-fill]. - A player with no legal move: `climb_step()` is always available while E>0. - Repetition / cycles: Finite because grease G(s) monotonically decreases with every attempt, driving P(slip)→0 and guaranteeing that a climber will eventually reach h=10. - Simultaneous claims on the same resource or position: Inapplicable; attempts are strictly sequential. - Player elimination mid-round: Failed attempts do not eliminate agents; agents rotate through queue. - Resource exhaustion: Grease on the pole is depleted monotonically, which is the core game mechanic. - Termination guarantee: Monotonic decrease of grease G(s) combined with fixed queue rotation ensures deterministic game conclusion. ## State representation - Persistent state: - `pole_grease`: array of 10 floats (G(s)∈[0.05..1.0]). - `agent_queue`: array of agent indices. - `current_climber_index`: integer. - `max_height_reached`: array of size k (highest h achieved per agent). - `round_number`: integer 1..10. - Observable information: Fully observable public state (grease levels on all segments and previous heights are known). ## Action space - `climb_step(effort)`: integer u∈{1,2,3} (effort tier balancing speed against stamina and slip risk). ## Playability notes - Single-player-vs-AI: Playable as a cooperative-competitive queue game where earlier players must balance wiping the pole vs risking a high push for the top. - Group games (n>4): Ideal for 4 to 8 agents. - Physical-skill games: Skin-friction physics and muscle endurance are formalized into dynamic state variables. - What is lost in the adaptation: The physical sensation of grease coating the skin and the cheering roar of festival spectators. ## Implementation hints Sequential loop with shared mutable pole environment. Very low memory footprint. First milestone: Implement 3-agent queue with fixed effort policies to verify grease depletion curves and convergence to top climb.

Download as JSON

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

Download JSON
Cite this page

Greased Bamboo Pole Climbing (Philippines). (n.d.). Games of Countries. https://gamesofcountries.com/games/ph-philippines/palo-sebo

@misc{gamesofcountries-ph-philippines-palo-sebo,
  title = {Greased Bamboo Pole Climbing (Philippines)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/ph-philippines/palo-sebo}
}