Skip to main content
Formal Specification

Haida Stick-Guessing Game — Formal Specification

Canada · guessing-hidden · Confidence: low

← Back to game page

Implementation Suitability

Suitability: adaptation-requiredFidelity: discretizedGap-fills: 2
# Haida Stick-Guessing Game — AI-optimized specification ## General idea A hidden-object guessing game: one player conceals a marked 'bait' stick among a bundle divided into two or three unseen parcels, and the opponent must guess which parcel holds it, sticks changing hands with each guess until one player has won them all. ## Formal model State: divider_id, guesser_id, parcels (2 or 3, each a hidden count of sticks with exactly one containing the djil), sticks_A, sticks_B. ## Formal rules R1. The divider conceals the current stick set (including the djil) under cedar bark and splits it into 2-3 parcels, unseen by the guesser. R2. The guesser selects one parcel. R3. The divider reveals whether the selected parcel contains the djil. R4. [gap-fill] On a correct guess, a fixed but unattested number of sticks transfers from the divider to the guesser, and the roles swap for the next round (the guesser becomes the next divider), per Swanton's account of role-swap-on-success. R5. [gap-fill] On an incorrect guess, sticks transfer from the guesser to the divider instead, and the same divider repeats the concealment for another round, per Swanton's account of the divider repeating on a correct opposing failure. R6. Play continues until one player holds all the sticks. ## Edge cases Tie at end condition: not applicable — sticks are a finite, exactly-conserved resource transferred in whole units each round, so exactly one player eventually holds them all. No legal move: not applicable — a guess is always available to the guesser, and concealment is always available to the divider. Repetition/cycles: many rounds of role-swapping (R4) or divider-repeats (R5) before resolution is the documented normal mode, not a failure state. Simultaneous conflicting actions: not applicable — divider and guesser act in strict sequence each round. Mid-round elimination: not applicable — exactly two active players throughout. Resource exhaustion: the shared stick pool is the central depleting/redistributing resource, and the game's win condition is defined by one player's pool reaching zero. Termination guarantee: guaranteed — sticks transfer monotonically toward one player's pool with each round, and the pool is finite. ## State representation (divider_id: player_id, guesser_id: player_id, sticks: dict[player_id -> int], parcel_count: 2|3) ## Action space conceal_divide(divider) — hide and split the current stick set into parcels; guess_parcel(guesser) — select a parcel believed to contain the djil. ## Playability notes Because the source's four cross-checked accounts agree on the game's overall shape but not on the exact stick-transfer amount per guess, implement the transfer count as an explicit, flagged parameter rather than inventing a specific number and presenting it as sourced. The role-swap-on-success / repeat-on-failure structure (R4-R5) is drawn specifically from Swanton's account and should be flagged as the version followed, since Poole's earlier account is vaguer about exactly when roles change. ## Implementation hints This reduces cleanly to a simple alternating-stakes guessing game; the only real design decision is the per-round transfer amount and the exact role-swap trigger, both flagged above as gap-fills rather than firmly sourced.

Download as JSON

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

Download JSON
Cite this page

Haida Stick-Guessing Game (Canada). (n.d.). Games of Countries. https://gamesofcountries.com/games/ca-canada/haida-stick-guessing-game

@misc{gamesofcountries-ca-canada-haida-stick-guessing-game,
  title = {Haida Stick-Guessing Game (Canada)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/ca-canada/haida-stick-guessing-game}
}