Skip to main content
Formal Specification

Hide the Key — Formal Specification

Faroe Islands · guessing-hidden · Confidence: high

← Back to game page

Implementation Suitability

Suitability: engine-readyFidelity: discretizedGap-fills: 4
# Krógva lykil — AI-optimized specification ## General idea A traditional Faroese asymmetric hidden-information game where one hider secretly conceals a key within an indoor environment, and one or more seekers navigate the space to discover it using discrete verbal proximity feedback ("ice cold", "lukewarm", "hot", "burning"). The game emphasizes spatial deduction, Bayesian search optimization, and thermal gradient navigation. ## Formal model - **Abstraction taken:** The 3D physical room and loose furniture are discretized into an N×M grid (or graph of hiding nodes G=(V,E)). [gap-fill] Proximity feedback is formalized as a discrete Manhattan distance metric d(ps,pkey)=|xs−xkey|+|ys−ykey| mapped to traditional Faroese verbal categories. - **Player/agent count:** 1 hider agent H and k seeker agents S1,…,Sk (where k≥1, commonly 1 to 4). - **Turn model:** Two-phase structure: an initial single-move hiding phase by H, followed by alternating sequential movement turns among seekers S1,…,Sk with synchronous feedback broadcast from H. ## Formal rules R1. Setup: A grid of dimensions N×M contains valid hiding/search cells. Hider H secretly chooses one cell pkey=(xk,yk)∈V. All seekers Si start at the room entry cell pstart=(0,0). R2. Hiding constraints: pkey must be a valid open/searchable cell (cannot be placed in an impassable wall obstacle). R3. Movement and search: On seeker Si's turn, Si moves to an adjacent cell pi′∈Neighbors(pi) or remains in place to search the current cell. R4. Feedback broadcast: Immediately following Si's move, hider H computes distance d=d(pi′,pkey) and outputs public signal θ∈{Ískalt,Lunkin,Heitt,Brennheitt} according to: - Ískalt (ice cold): d≥5 - Lunkin (lukewarm): 3≤d≤4 - Heitt (hot): 1≤d≤2 - Brennheitt (burning hot): d=0 (at target cell) [gap-fill] These distance thresholds formalize traditional qualitative calling conventions. R5. Win condition: The first seeker Si who moves to pi=pkey and executes the `reveal_key()` action discovers the key, earns 1 point, and becomes the hider for the subsequent round. R6. [gap-fill] Max turn limit: If the key is not found within Tmax⁡=2×(N×M) total moves, the round ends; hider H earns 1 point, and the role of hider rotates to the next player. ## Edge cases - Tie at the end condition: Not applicable — seekers move sequentially; the first seeker to land on and declare the key wins the round immediately. - A player with no legal move: Not applicable — grid is fully connected; an agent can always move to at least one neighboring cell or search current cell. - Repetition / cycles: Bounded by R6 (maximum move limit Tmax⁡ forces termination if seekers cycle without finding the key). - Simultaneous claims on the same resource or position: Not applicable — multiple seekers may occupy the same cell, but turns are strictly sequential; the active seeker on that turn claims discovery. - Player elimination mid-round; turn order repair: If a seeker drops out, they are removed from the rotation; turn order proceeds Si+1(modk). - Resource exhaustion: Not applicable — the key is a single persistent target. - Termination guarantee: Provably terminates in at most Tmax⁡ turns. ## State representation - Persistent state: Grid topology N×M, cumulative scores per agent, current hider identity. - Per-round hidden state: Secret key coordinate pkey=(xk,yk) (hidden from all seekers). - Per-turn ephemeral state: Active seeker index, current coordinates of all seekers [p1,…,pk], last broadcast feedback signal θ. - Observable information: - Hider observes: Full state (pkey and all seeker positions). - Seekers observe: Grid dimensions, own position, all seeker positions, history of feedback signals {θt}t=1T. Key location pkey is hidden. ## Action space - `hide_key(x, y)`: Executed once by H during setup (0≤x<N,0≤y<M). - `move(direction)`: Seeker moves `north`, `south`, `east`, `west`. - `reveal_key()`: Seeker checks current cell for the key. ## Playability notes - Single-player-vs-AI: Natural — 1 human seeker vs. 1 AI hider (AI conceals key and generates feedback), or 1 human hider vs. 1 AI seeker running Bayesian probability map updates. - Group games (n>4): Fully supported — multiple seekers take turns moving; seekers observe each other's feedback signals, creating competitive information pooling. [gap-fill] A standard 1v1 match reduces seekers to 1 without altering search mechanics. - Physical-skill games: Not applicable — purely a spatial hidden-information search game. - What is lost: The physical searching under cushions and behind hearthstones, and vocal intonation/banter of the hider's calls. ## Implementation hints Low complexity and completely engine-ready. Seeker AI can maintain a probability distribution over grid cells updated via Bayes' rule based on distance bands. First milestone: implement a 6×6 grid with 1 hider and 1 seeker, logging distance feedback strings.

Download as JSON

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

Download JSON
Cite this page

Hide the Key (Faroe Islands). (n.d.). Games of Countries. https://gamesofcountries.com/games/fo-faroe-islands/krogva-lykil

@misc{gamesofcountries-fo-faroe-islands-krogva-lykil,
  title = {Hide the Key (Faroe Islands)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/fo-faroe-islands/krogva-lykil}
}