Skip to main content
Formal Specification

Blind Man's Buff — Formal Specification

Brazil · chase-tag · Confidence: medium

← Back to game page

Implementation Suitability

Suitability: adaptation-requiredFidelity: discretizedGap-fills: 3
# Cabra-cega — AI-optimized specification ## General idea Blind man's buff with an identification requirement: catching someone is not enough, the blindfolded player must then name who was caught by touch and voice alone. That second step is what makes it a genuine imperfect-information game rather than a pursuit — the seeker has a position problem and an inference problem at once. ## Formal model - **Abstraction taken:** the play area becomes a grid and movement becomes cell steps; blindness becomes a strict information restriction rather than simulated sensory noise. The seeker observes only adjacency and the outcome of touch, not positions. - **Player/agent count:** 3 or more; exactly one seeker, the rest evaders. - **Turn model:** ticked. All evaders move simultaneously, then the seeker moves, then contact is resolved. ## Formal rules R1. One player is blindfolded and placed at the centre. The others form a circle around them. R2. A fixed call-and-response exchange precedes play. [gap-fill] The entry records that the specific dialogue lines and their sequence are undocumented; the spec treats the exchange as a fixed-length preamble of k ticks with no state effect. R3. The seeker performs three spins before pursuing. Model this as randomising the seeker's facing uniformly; it has no other effect. R4. Each tick, every evader moves to an adjacent cell or holds. The seeker then moves to an adjacent cell. R5. If the seeker ends a tick on a cell adjacent to an evader, contact occurs and the seeker may `grab()`. R6. On a successful grab the seeker must `identify(player_id)` using only the information set defined below. R7. A correct identification makes the identified player the new seeker; the round restarts from R3. R8. [gap-fill] On an incorrect identification the grabbed player is released and given one free move before play resumes, and the seeker continues. The entry explicitly marks the consequence of a wrong guess undocumented; without a rule the game can deadlock on a repeated wrong grab. R9. [gap-fill] Evaders may not leave the bounded play area, and a cornered evader may not pass through the seeker. Sources do not state boundaries, but an unbounded area makes capture impossible. R10. The game has no terminal win condition; it continues until players stop. For a bounded artifact, terminate after a fixed number of role changes. ## Edge cases - **Tie at the end condition:** not applicable, because there is no scoring and no winner — the role of seeker rotates and the game is a process rather than a contest. If a round limit is imposed, the player who was seeker fewest times is declared winner. - **Player with no legal move:** an evader boxed into a corner by R9 may hold in place; holding is always legal, so no agent is ever stuck. - **Repetition / cycles:** an unlucky seeker can wander indefinitely. R8's free-move rule plus the bounded area of R9 keep capture probability positive each tick, but the cycle is real and is broken only by the round limit in R10. - **Simultaneous claims:** evaders move simultaneously and two may target the same cell. Resolve by lower agent index; the other holds. - **Mid-round elimination and turn-order repair:** nobody is eliminated — the seeker role transfers instead. Turn order is by role, not index, so a transfer needs no repair. - **Resource exhaustion:** nothing is consumed. Time is the only bounded resource, and only through R10. - **Termination guarantee:** the rules alone do not guarantee termination; the game is genuinely open-ended. Termination comes only from the imposed round limit in R10, and this should be stated rather than disguised. ## State representation Persistent: grid bounds, evader count. Per-player: cell, role (`seeker|evader`), and for the seeker, facing. Per-turn ephemeral: pending grab, pending identification. Information set — this is the crux: evaders observe everything, including the seeker's cell. The **seeker observes only** its own cell, its facing, whether a grab succeeded, and whatever identity signal the grabbed player emits. It does not observe positions. Any implementation that lets the seeker read the board has thrown away the game. ## Action space - `move(direction)` — precondition: destination is inside bounds and not occupied by the seeker. - `hold()` — always legal. - `grab()` — precondition: actor is the seeker and at least one evader is adjacent. - `identify(player_id)` — precondition: a grab succeeded this tick. ## Playability notes - **Single-player-vs-AI:** natural, and unusually interesting, because the seeker is a belief-tracking problem. Give the agent the seeker role and a prior over evader identities updated by touch outcomes. - **Group games (n>2):** does not reduce well to two agents. With one evader the identification step is vacuous — there is only one person to name — and the inference half of the game disappears. Three is the true minimum. - **Physical-skill model:** the identification step is a probability of correct naming, parameterised by how distinguishable the grabbed player is. Movement itself needs no skill model. - **What is lost:** the voice. Real players disguise their voices and hold their breath, and the whole comedy of the game is in that performance. A discrete identity signal captures none of it. ## Implementation hints Build the information asymmetry first — a seeker that can see positions is a different and much duller game, and it is the easiest thing to get wrong here. Represent the seeker's belief as a distribution over which evader is where, updated on each grab. Branching factor is small for the seeker (a handful of moves plus grab) and larger for the evader set collectively; simulate evaders with a simple flee heuristic before doing anything more elaborate.

Download as JSON

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

Download JSON
Cite this page

Blind Man's Buff (Brazil). (n.d.). Games of Countries. https://gamesofcountries.com/games/br-brazil/cabra-cega

@misc{gamesofcountries-br-brazil-cabra-cega,
  title = {Blind Man's Buff (Brazil)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/br-brazil/cabra-cega}
}