Skip to main content
Formal Specification

Five Names Finger Elimination — Formal Specification

Pakistan · counting-out · Confidence: low

← Back to game page

Implementation Suitability

Suitability: engine-readyFidelity: directGap-fills: 2
# Yassoo Panjoo — AI-optimized specification ## General idea A simultaneous-choice discrete elimination game for 5 players. Each round, active players choose a secret integer `f_i in {1, 2, 3, 4, 5}`. The sum `S = sum(f_i)` is evaluated under modular arithmetic `(S - 1) mod 5` to index one of the five fixed roles `(Yassoo=0, Panjoo=1, Haar=2, Kabootar=3, Doli=4)`. The owning agent of the winning role is eliminated (safely banked), repeating until only 1 loser remains. ## Formal model - **Abstraction taken:** None required (`fidelity_class: direct`). The game is naturally a discrete simultaneous-move state machine over finite integers. - **Player/agent count:** 5 agents `A_0..A_4`. Role mapping: `Role(A_k) = k` where `k in {0..4}` corresponding to `{Yassoo, Panjoo, Haar, Kabootar, Doli}`. - **Turn model:** Simultaneous discrete rounds of hidden integer selection. ## Formal rules R1. Setup: Active player set `Active = {A_0, A_1, A_2, A_3, A_4}`. Safe set `Safe = {}`. R2. Simultaneous Choice: Each agent `A_k in Active` simultaneously selects an integer `f_k in {1, 2, 3, 4, 5}`. R3. Outcome Evaluation: - Compute total fingers: `S = sum_{A_k in Active} f_k`. - Compute winning role index: `target_idx = (S - 1) mod 5`. - Find the agent `A_target` who currently owns `target_idx`. R4. Elimination Resolution: - If `A_target in Active`: - `A_target` is removed from `Active` and added to `Safe` (`Active = Active \ {A_target}`). - `Safe.append(A_target)`. - If `A_target notin Active` (already safe in previous round): - [gap-fill] The round is a re-roll (null round); `Active` remains unchanged, and agents choose again. R5. Win/Loss Condition: - When `|Active| == 1`: The sole remaining agent in `Active` is the Loser (`loser_id`). All agents in `Safe` are Winners, ordered by elimination sequence. - Match terminates. R6. [gap-fill] Slapping penalty evaluation: Each winner in `Safe` receives `score = 100 - (order * 10)`; Loser receives `score = 0`. ## Edge cases - **Tie at the end condition:** Not applicable; modular arithmetic uniquely maps integer `S` to exactly one role index `target_idx in {0..4}`. - **A player with no legal move:** Integer selection `{1..5}` is always legal. - **Repetition / cycles:** Re-roll rounds (R4) terminate with probability 1 since each remaining agent chooses independently from `{1..5}`, yielding a uniform positive probability of landing on an active role index. - **Simultaneous claims on the same resource or position:** Roles are partitioned uniquely (bijective mapping) across agents at start. - **Player elimination mid-round:** Elimination is the core progression mechanic. Active set strictly decrements from 5 to 1. - **Resource exhaustion:** Not applicable; integers `{1..5}` are chosen fresh each round. - **Termination guarantee:** Guaranteed by finite absorbing state `|Active| == 1` and geometric distribution of non-null rounds. ## State representation - **Persistent state:** `active_players_set`, `safe_players_list`, `round_counter`. - **Per-round ephemeral state:** `choices[1..5]` (hidden until simultaneous reveal), total sum `S`, `target_idx`. - **Observable information:** - Game configuration, active roster, and previous round outcomes are public. - Current-round choice `f_k` is private until simultaneous reveal. ## Action space - `select_fingers(f in {1, 2, 3, 4, 5})`: Single discrete choice per active agent per round. ## Playability notes - **Single-player-vs-AI:** Natural; human player attempts to predict and exploit AI finger distribution biases. - **Group games (n>4):** Native 5-player design; can adapt to 2–4 players by assigning unowned roles to surviving players. - **Physical-skill games:** Not applicable (pure discrete strategic bluffing / probability). - **What is lost:** The kinetic chanting cadence and the physical comedy of dodging quick palm slaps at the game's conclusion. ## Implementation hints Extremely low complexity. The entire game logic requires fewer than 30 lines of code. Implement the simultaneous reveal and modular arithmetic `(S - 1) % 5` directly.

Download as JSON

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

Download JSON
Cite this page

Five Names Finger Elimination (Pakistan). (n.d.). Games of Countries. https://gamesofcountries.com/games/pk-pakistan/yassoo-panjoo

@misc{gamesofcountries-pk-pakistan-yassoo-panjoo,
  title = {Five Names Finger Elimination (Pakistan)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/pk-pakistan/yassoo-panjoo}
}