Formal Specification
Inuit String Figures — Formal Specification
Greenland · string-figure · Confidence: high
← Back to game pageImplementation Suitability
Suitability: engine-readyFidelity: directGap-fills: 4
# Ajaraaq — AI-optimized specification
## General idea
A traditional Greenlandic Inuit string figure game where players manipulate a closed continuous loop of sinew around the hands, thumbs, fingers, and teeth to construct codified geometric figures representing Arctic fauna, tools, and mythological beings. The game can be played as a progressive alternating pattern-transformation exchange or a synchronized construction speed duel.
## Formal model
- **Abstraction taken:** None for the discrete loop topology — string figures are naturally discrete topological knots and crossing graphs. [gap-fill] A string state is represented as a planar loop graph with finger assignment registers (e.g. Left Thumb, Right Index) and crossing permutations.
- **Player/agent count:** 1 agent (solo construction/narrative), 2 agents (alternating mutation duel or speed race).
- **Turn model:** Strictly alternating moves in progressive exchange mode; simultaneous execution in speed race mode.
## Formal rules
R1. Setup (Opening Position): The string begins in standard Inuit Opening A: the loop is suspended across both palms, passing behind the thumbs and little fingers, with middle/index fingers picking up the palmar crossings.
R2. Primitive action set: A legal move consists of an atomic string manipulation step:
- `hook_loop(source_finger, target_string, direction)`: Pick up an existing segment over or under another finger.
- `drop_loop(finger)`: Release tension from a designated finger register.
- `twist_loop(finger, direction)`: Apply a 180-degree half-twist to an active loop.
- `draw_taut()`: Extend hands outwards to verify stability.
R3. Target patterns: A codified catalogue of valid Inuit figures is defined (e.g. *Nanuq* / Polar Bear, *Tulugaq* / Raven, *Qajaq* / Kayak). Each figure is an exact target state of crossing nodes and finger holds.
R4. Alternating Transformation Mode:
- Agent 1 executes a valid sequence to display a recognized figure.
- Agent 2 must select a subset of interior crossings, insert their fingers, and lift the entire structure off Agent 1's hands (`transfer_figure`), creating a new valid mutated pattern without causing the string to collapse into a knot.
- If an agent performs an illegal transfer or collapses the string, that agent loses the round.
R5. Speed Duel Mode (*Ayahaq*): Both agents receive an identical initial string state and target figure. Upon start signal, agents execute manipulation sequences simultaneously. The first agent to reach the target state and call `draw_taut()` wins the point.
R6. [gap-fill] Match win condition: The first player to win points (default ) wins the match.
R7. [gap-fill] Dead-end / knot resolution: If an alternating transfer results in a self-locking knot with no legal continuation, the transferer concedes the round.
## Edge cases
- Tie at the end condition: In speed duel, if both complete on the identical tick, a tie-breaker figure of higher complexity is contested.
- A player with no legal move: If a player cannot execute a legal finger transfer on the existing string figure, they must pass/concede the round.
- Repetition / cycles: Bounded in progressive mode because figure complexity/crossing counts change per transfer; [gap-fill] threefold repetition of identical topological states is forbidden and results in a draw.
- Simultaneous claims on the same resource or position: In speed duels, each agent has their own independent string loop. In 2-player alternating mode, turns are strictly sequential during the physical transfer.
- Player elimination mid-round; turn order repair: In multi-player story circles, a player who fails figure construction passes the string to the next player clockwise.
- Resource exhaustion: String loop is indestructible and invariant in length.
- Termination guarantee: Provably terminates in speed duels by shortest path to target figure, and in progressive mode because the finite state space of reachable planar topologies contains absorbing terminal knot states.
## State representation
- Persistent state: Match scores, figure catalogue , game mode (`progressive` / `speed_duel`).
- Per-figure state: Loop topology represented as a cyclic permutation of loop segments and crossing nodes , finger hold registers .
- Observable information: Fully observable — all string crossings and hand positions are completely visible.
## Action space
- `pick_up(finger_id, segment_id, mode)`: Hook designated loop segment.
- `release_loop(finger_id)`: Drop loop from finger.
- `transfer_string(target_crossings)`: Two-player hand-off action.
- `call_complete()`: Declare figure completed.
## Playability notes
- Single-player-vs-AI: Natural — single player solves step-by-step figure puzzles (generating target animal shapes from opening positions); vs-AI mode benchmarks speed of algorithmic graph traversal.
- Group games (n>4): Plays as a sequential round-robin story-passing circle.
- Physical-skill games: Motor finger dexterity and speed can be discretized into action execution latencies.
- What is lost: The rhythmic throat-singing rhymes, tactile silkiness of braided seal sinew, and cosmological storytelling context.
## Implementation hints
Directly implementable as a graph transformation grammar. State can be formalized using standard knot theory / braid group generators or discrete topological coordinate lists. First milestone: implement Opening A and the 4-step sequence to produce the *Qajaq* (Kayak) figure deterministically.
Download as JSON
Download the full game corpus entry for this game as structured JSON.
Download JSONCite this page
Inuit String Figures (Greenland). (n.d.). Games of Countries. https://gamesofcountries.com/games/gl-greenland/ajaraaq
@misc{gamesofcountries-gl-greenland-ajaraaq,
title = {Inuit String Figures (Greenland)},
year = {n.d.},
publisher = {Games of Countries},
url = {https://gamesofcountries.com/games/gl-greenland/ajaraaq}
}