Formal Specification
Lehal (Thompson Hand Game) — Formal Specification
Canada · guessing-hidden · Confidence: low
← Back to game pageImplementation Suitability
Suitability: adaptation-requiredFidelity: discretizedGap-fills: 2
# Lehal (Thompson Hand Game) — AI-optimized specification
## General idea
One side passes a plain and a marked bone through their hands while singing; the other side guesses which hand holds the plain bone, forfeiting a counter on a wrong guess and winning the bones (plus the turn to hide) on a correct one, until one side holds all 12 counters.
## Formal model
State: hiding_side, plain_bone_hand (concealed from the guessing side), counters_A, counters_B (starting 6 each, totaling 12).
## Formal rules
R1. The hiding side's active player conceals the plain bone in one hand (with the marked bone visible or otherwise accounted for) while the side sings. R2. The guessing side names a hand. R3. If correct, the guessing side wins the bones and becomes the new hiding side for the next round. R4. If incorrect, the guessing side forfeits one counter to the hiding side, and the hiding side continues (or a new player on that side takes over hiding [gap-fill: role-continuation convention after wrong guess], per Swanton-style patterns seen in comparable hand games in this catalogue). R5. [gap-fill: play continues until one side holds all 12 counters].
## Edge cases
Tie at end condition: not applicable — 12 counters are a finite, exactly-conserved resource, so exactly one side eventually holds them all. No legal move: not applicable — hiding and guessing are always available each round. Repetition/cycles: many rounds before resolution is the documented normal mode. Simultaneous conflicting actions: not applicable — hiding and guessing happen in strict turn sequence. Mid-round elimination: not applicable — both full rows remain engaged throughout; no individual player is removed. Resource exhaustion: the 12-counter stake is the central depleting/redistributing resource defining the win condition. Termination guarantee: guaranteed — counters transfer monotonically toward one side with each round, and the pool is finite.
## State representation
(hiding_side: side_id, counters: dict[side_id -> int], active_hider: player_id)
## Action space
conceal_bone(hider) — hide the plain bone in one hand while the side sings; guess_hand(guessing_side) — name which hand holds the plain bone.
## Playability notes
The role-transfer rule on a correct guess (R3, winning both the bones and the turn) versus what happens on a wrong guess (R4, forfeiting a counter, hiding side continues) is the clearest documented mechanic and should be implemented as stated; whether the SAME hiding player continues after a wrong guess or a teammate takes over is not specified and is flagged as an open detail. The performance layer (song, drumming, knuckle-coverings, rattling wrist-strings) is culturally significant context that does not affect the win condition and should be modelled as flavour, not mechanics.
## Implementation hints
This is structurally close to a classic two-outcome hidden-object guessing game (comparable to the Haida stick-guessing game catalogued separately) and can share implementation logic with it, differing mainly in the fixed 12-counter/32-stick stake structure versus the Haida game's variable stick-pool structure.
Download as JSON
Download the full game corpus entry for this game as structured JSON.
Download JSONCite this page
Lehal (Thompson Hand Game) (Canada). (n.d.). Games of Countries. https://gamesofcountries.com/games/ca-canada/lehal
@misc{gamesofcountries-ca-canada-lehal,
title = {Lehal (Thompson Hand Game) (Canada)},
year = {n.d.},
publisher = {Games of Countries},
url = {https://gamesofcountries.com/games/ca-canada/lehal}
}