Skip to main content
Formal Specification

Pizzi Pizzi Kanna (Maltese Counting-Out Game) — Formal Specification

Malta · counting-out · Confidence: low

← Back to game page

Implementation Suitability

Suitability: engine-readyFidelity: directGap-fills: 0
# Pizzi Pizzi Kanna — AI-optimized specification ## General idea A deterministic counting-out elimination procedure (Josephus-permutation variant) on a circular array of active fingers. A leader traverses the active ring tapping on each syllable of a fixed 31-syllable rhyme; the finger landing on the 31st syllable is eliminated, repeating until exactly 1 finger remains. ## Formal model - **Abstraction taken:** Direct mathematical formalization. Modeled as an ordered circular list of active items `Ring = [f_1, f_2, ..., f_M]` where each player contributes `K = 10` (or `K = 5`) fingers. Rhyme length is fixed at `S = 31` syllables. - **Player/agent count:** 2 to 10 players. - **Turn model:** Deterministic procedural execution. ## Formal rules R1. Setup: Total players `N`. Total initial fingers `M = N * K`. Each finger is identified by `(player_id, finger_idx)`. Initial list `Active = [0, 1, ..., M-1]`. Starting pointer `current_idx = 0`. R2. Elimination cycle: R2.1. While `|Active| > 1`: R2.2. Target index to eliminate is computed via modular arithmetic: `elim_idx = (current_idx + (S - 1)) mod |Active|`. R2.3. The finger `Active[elim_idx]` is removed from `Active`. R2.4. Pointer for next cycle: `current_idx = elim_idx mod |Active|`. R3. Win condition: When `|Active| == 1`, the player owning the single remaining finger is declared winner / selected "it" player. ## Edge cases - Tie at the end condition: Not applicable — the elimination sequence terminates with exactly one surviving element. - A player with no legal move: Not applicable — procedure is fully deterministic. - Repetition / cycles: Bounded because each cycle strictly reduces `|Active|` by 1. Exactly `M - 1` cycles occur. - Simultaneous claims on the same resource or position: Not applicable — indexing is strictly sequential. - Player elimination mid-round: If a player loses all their fingers, their items are already removed; turn order naturally continues. - Resource exhaustion: Monotonic elimination down to 1 survivor. - Termination guarantee: Guaranteed by strictly monotonic reduction of the finite set `Active`. ## State representation - Persistent state: `active_fingers` (list of pairs `(player_id, finger_idx)`), `current_pointer` (int). - Per-cycle ephemeral state: `syllable_step` (int 1..31), `eliminated_finger` `(player_id, finger_idx)`. - Observable information: Fully observable by all agents. ## Action space - `step_chant()`: Deterministic evaluation step. ## Playability notes - Single-player-vs-AI: Procedural tool — used as a fair pseudo-random or deterministic selector for starting players in other games. - Group games (n>4): Perfectly scales to any group size. - Physical-skill games: Direct mathematical abstract. - What is lost: The melodic lilt of children's voices chanting in Maltese. ## Implementation hints Classic modular arithmetic ring reduction. O(N) execution time.

Download as JSON

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

Download JSON
Cite this page

Pizzi Pizzi Kanna (Maltese Counting-Out Game) (Malta). (n.d.). Games of Countries. https://gamesofcountries.com/games/mt-malta/pizzi-pizzi-kanna

@misc{gamesofcountries-mt-malta-pizzi-pizzi-kanna,
  title = {Pizzi Pizzi Kanna (Maltese Counting-Out Game) (Malta)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/mt-malta/pizzi-pizzi-kanna}
}