Formal Specification
Zimbabwean Traditional Triangular Three-in-a-Row Board Game — Formal Specification
Zimbabwe · board-abstract · Confidence: low
← Back to game pageImplementation Suitability
Suitability: engine-readyFidelity: directGap-fills: 3
# Tsoro Yematatu — AI-optimized specification
> **Reconstructed source.** The entry carries a provenance warning: its rules were written from
> general knowledge, not read from the two works it cites (Zaslavsky 1973; Bourdillon 1976).
## General idea
A classic Zimbabwean two-player abstract strategy board game played on a 7-vertex triangular grid
scratched in sand or stone. Each player commands three stones (*Mabwe*), aiming to create a straight-line
alignment of all three pieces. The game features a drop phase (Phase 1) followed by a movement phase
(Phase 2) where pieces slide to adjacent vacant vertices or jump over opponent pieces to vacant points beyond.
Because jumping does not capture pieces and movements can cycle indefinitely, termination is not formally
guaranteed without cycle-breaking rules.
## Formal model
- **Abstraction taken:** None. Discrete 7-vertex graph topology, deterministic moves, perfect information.
- **Player/agent count:** Exactly 2 players, alternating.
- **Turn model:** Two-phase sequential alternating turns: Phase 1 (Drop Phase) followed by Phase 2 (Move/Jump Phase).
## Formal rules
R1. Setup (entry §1): played on an **empty triangular board with 7 vertices** (1 apex, 3 mid-points,
3 base points). Each player holds **3 stones** in hand.
R2. Phase 1 — Drop Phase (entry §2): players alternate placing 1 stone from hand onto any vacant vertex
on the triangle until all 6 stones are placed.
R3. Phase 2 — Move/Jump Phase (entry §3): once all stones are on the board, players alternate moving 1
friendly stone:
- **Slide** along an inscribed line to an adjacent vacant vertex; OR
- **Jump** over an opponent piece to a vacant vertex immediately beyond along a line.
R4. Non-capturing jumps: jumping over an opponent piece does **not** capture or remove the jumped piece
[gap-fill: jumping is a movement mechanic only; jumped pieces remain on the board].
R5. Win condition (entry §4): the **first player to align all 3 friendly stones in a straight line**
(along any of the 3 triangular sides, the vertical bisector, or horizontal segments) wins immediately.
R6. Jumping over friendly stones:
[gap-fill: the entry specifies jumping over an opponent piece; jumping over friendly pieces is not
stated and assumed barred].
R7. Repetition and draw rules:
[gap-fill: the entry defines no draw rule for three-fold repetition or non-progress in Phase 2].
## Edge cases
- Tie at the end: unaddressed; the entry defines only a decisive 3-in-a-row victory condition (R5) and
provides no draw condition for cyclic stalling.
- A player with no legal move: unaddressed; if a player's 3 stones are completely blocked with no legal
slides or jumps, the entry does not specify whether this constitutes a loss, pass, or draw.
- Repetition / cycles: unaddressed; Phase 2 sliding and jumping on a 7-vertex graph can cycle between
identical positions indefinitely without alignment; no cycle detection is stated.
- Simultaneous claims on one position: not applicable; strictly alternating turns and each vertex holds
at most one stone.
- Elimination mid-round and turn-order repair: stones are never eliminated from the board; strict 2-player
alternation is preserved throughout.
- Resource exhaustion: hand stones deplete from 3 to 0 in Phase 1; all 6 stones remain on the board
throughout Phase 2.
- Termination guarantee: not guaranteed; Phase 2 movements can cycle indefinitely on the 7-node graph
without ever producing an alignment, and no move limit is defined.
## State representation
- Persistent state: `vertices[7]` ∈ {empty, p1, p2}, `hand[2]` ∈ {0..3}, `phase` ∈ {1, 2}, `active_player` ∈ {0, 1}.
- Per-turn ephemeral state: `placed_vertex`, `moved_from`, `moved_to`, `is_jump` (bool).
- Observable information: fully observable, perfect information.
## Action space
- `place(vertex)`: Phase 1 active player places stone on vacant vertex (0..6) (R2).
- `slide(from_v, to_v)`: Phase 2 active player slides stone to adjacent connected vacant vertex (R3).
- `jump(from_v, over_v, to_v)`: Phase 2 active player jumps over opponent stone to vacant collinear vertex (R3).
## Playability notes
- Single-player-vs-AI: fast, lightweight combinatorial search; perfect for minimax or depth-limited MCTS.
- Reducing n > 4 to 2 agents: not applicable; strictly two-player.
- Physical-skill games: not applicable; abstract alignment board game.
- What is lost: the geometric sand-sketching and rapid social banter of Shona and Ndebele schoolchildren.
## Implementation hints
Index the 7 vertices: 0 (Apex), 1 (Left Mid), 2 (Right Mid), 3 (Center), 4 (Left Base), 5 (Center Base),
6 (Right Base). Define the straight-line win triplets: (0, 1, 4), (0, 2, 6), (0, 3, 5), (4, 5, 6), (1, 3, 2).
Adjacency graph has 7 nodes and 9 edges. Implement jumping by checking collinear 3-in-a-row lines where
`from` is friendly, `over` is opponent, and `to` is vacant. Add a 30-ply move limit or three-fold repetition
check for clean engine termination. Suggested first milestone: 7-node graph with alignment check and jump validation.
Download as JSON
Download the full game corpus entry for this game as structured JSON.
Download JSONCite this page
Zimbabwean Traditional Triangular Three-in-a-Row Board Game (Zimbabwe). (n.d.). Games of Countries. https://gamesofcountries.com/games/zw-zimbabwe/tsoro-yematatu
@misc{gamesofcountries-zw-zimbabwe-tsoro-yematatu,
title = {Zimbabwean Traditional Triangular Three-in-a-Row Board Game (Zimbabwe)},
year = {n.d.},
publisher = {Games of Countries},
url = {https://gamesofcountries.com/games/zw-zimbabwe/tsoro-yematatu}
}