Skip to main content
Formal Specification

Goats and Tigers Game — Formal Specification

India · board-abstract · Confidence: high

← Back to game page

Implementation Suitability

Suitability: engine-readyFidelity: directGap-fills: 3
# Aadu Puli Aattam — AI-optimized specification ## General idea Aadu Puli Aattam is an ancient South Indian asymmetric hunt game played on a 23-node triangular-and-trapezoidal graph. One player commands three predatory tigers seeking to capture goats by leaping over them into vacant spaces, while the opposing player commands fifteen cooperative goats attempting to encircle and immobilize all three tigers. The game features a distinct two-phase transition: goats are introduced drop-by-drop during a placement phase before gaining movement capability across the board. ## Formal model - **Abstraction taken:** Direct topological representation. The continuous geometric lines of the traditional temple board are modeled as an undirected graph G=(V,E) with |V|=23 vertices and defined edge sets, including collinear leap triples (u,v,w) where v is adjacent to both u and w in a straight line. - **Player/agent count:** 2 agents (Ptiger,Pgoat). - **Turn model:** Strictly sequential alternating turns starting with Pgoat. ## Formal rules R1. **Board Topology & Initial Setup:** - Graph V={v1,v2,…,v23} arranged as an isosceles triangle (apex v1, base v2,v3,v4) joined to a 4-tier trapezoidal grid. - At start t=0: Tigers occupy fixed starting nodes: T={v1,v2,v4} (apex and outer base nodes of the top triangle). - Goats in hand: Ghand=15; Goats on board: Gboard=∅; Captured goats: Cgoat=0. R2. **Phase 1 (Placement Phase: turns 1≤k≤15 for Goats):** - Pgoat must choose one vacant node v∈V∖(T∪Gboard) and place 1 goat: Gboard←Gboard∪{v}, Ghand←Ghand−1. - Goats on the board cannot move along edges during Phase 1. - Ptiger moves on each alternating turn: chooses one tiger ti∈T and executes either a step move or a jump capture. R3. **Phase 2 (Movement Phase: once Ghand=0):** - Pgoat selects one goat g∈Gboard and moves it along an edge (g,u)∈E to a vacant node u∈V∖(T∪Gboard). - Goats cannot leap, jump over other pieces, or capture. R4. **Tiger Actions (Both Phases):** - **Step Move:** Move tiger from ti∈T to an adjacent empty node u, where (ti,u)∈E and u∉(T∪Gboard). - **Jump Capture:** Leap over an adjacent goat g∈Gboard along a straight collinear path to land on an immediately adjacent vacant node w: (ti,g)∈E, (g,w)∈E, path (ti,g,w) is collinear, and w∉(T∪Gboard). - The jumped goat is removed permanently: Gboard←Gboard∖{g}, Cgoat←Cgoat+1. - Tigers cannot jump over other tigers, cannot jump multiple goats in one turn, and cannot jump without an empty landing node immediately behind the goat. R5. **Victory Conditions:** - **Goats Win:** If at the start of Ptiger's turn, no tiger ti∈T has any legal step move or legal jump capture available (all 3 tigers are completely immobilized). - **Tigers Win:** If Cgoat≥5 [gap-fill: standard threshold where mathematically sufficient blocking mass is lost], or if Pgoat has no legal move during Phase 2. R6. **Draw Condition:** [gap-fill] If the exact same board configuration (positions of all tigers and goats on board, with identical phase status) repeats three times with the same player to move, the game ends in a draw (threefold repetition rule). ## Edge cases - **Tie at the end condition:** Not applicable — win conditions for Tigers and Goats are mutually exclusive. A draw is only achievable via threefold repetition or maximum move cap. - **A player with no legal move:** If Ptiger has no legal move, Pgoat wins immediately. If Pgoat has no legal move during Phase 2, Ptiger wins immediately. - **Repetition / cycles:** Bounded by R6 (threefold repetition rule). [gap-fill] A hard limit of 100 plies without a capture forces a draw to prevent infinite stall cycles. - **Simultaneous claims on the same resource or position:** Not applicable — turn structure is strictly sequential, and all node occupancy is mutually exclusive. - **Player elimination mid-round; turn order repair:** Not applicable — strictly 2 players; capture removes goat tokens from the state without affecting turn alternation. - **Resource exhaustion (pieces, tokens, space, time):** Goats in hand decrement monotonically from 15 to 0, triggering Phase 2. Captured goats decrement the active goat pool monotonically. - **Termination guarantee: why the game provably ends:** Phase 1 terminates after exactly 15 goat placement turns. Phase 2 either terminates by capture accumulation (Cgoat≥5), tiger immobilization, or the move-limit / threefold repetition draw rule. ## State representation - **Persistent state:** - T⊂V: positions of the 3 tigers (|T|=3). - Gboard⊂V: positions of active goats on the board (|Gboard|≤15). - Ghand∈[0,15]: count of goats remaining in hand. - Cgoat∈[0,15]: count of captured goats. - active_player∈{Pgoat,Ptiger}. - phase∈{Phase 1: Placement,Phase 2: Movement}. - repetition_history: hash map of past state signatures to occurrence counts. - plies_since_capture∈ℕ: counter for the 100-ply draw clock. - **Observable information:** Fully observable game state (perfect information). ## Action space - `place_goat(target_node)`: Pgoat only (Phase 1). Preconditions: phase=Placement, target_node∈V∖(T∪Gboard). - `move_goat(from_node, to_node)`: Pgoat only (Phase 2). Preconditions: phase=Movement, from_node∈Gboard, (from_node,to_node)∈E, to_node∉(T∪Gboard). - `move_tiger(from_node, to_node)`: Ptiger only. Preconditions: from_node∈T, (from_node,to_node)∈E, to_node∉(T∪Gboard). - `jump_tiger(from_node, over_node, to_node)`: Ptiger only. Preconditions: from_node∈T, over_node∈Gboard, to_node∉(T∪Gboard), (from_node,over_node,to_node) forms a valid collinear line in G. ## Playability notes - **Single-player-vs-AI:** Highly natural for minimax, alpha-beta pruning, or Monte Carlo Tree Search (MCTS). The asymmetric utility creates distinct heuristic profiles for the Tiger and Goat roles. - **Group games (n>4):** Not applicable; inherently a 2-player zero-sum duel. - **Physical-skill games:** Not applicable; abstract strategy. - **What is lost in the adaptation:** Tactile experience of temple stone carvings and regional banter during village gameplay. ## Implementation hints - Represent the 23-node board as an adjacency list and a precomputed lookup table of collinear jump triples `JUMPS[from_node][over_node] -> to_node`. - Branching factor: In Phase 1, Goats have up to 20 placement choices; Tigers have 3 pieces with ≈2–4 legal steps/jumps (branching factor ≈10–20). In Phase 2, branching factor drops to ≈15–30. - Obvious representational trap: Forgetting that jumps must follow strict collinear lines along the board's structural axes; diagonal leaps across non-connected grid intersections are illegal. - Suggested first milestone: Construct graph G with the 23 nodes and collinear jump table; implement valid move generators and verify Phase 1 to Phase 2 transition after 15 goat drops.

Download as JSON

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

Download JSON
Cite this page

Goats and Tigers Game (India). (n.d.). Games of Countries. https://gamesofcountries.com/games/in-india/aadu-puli-aattam

@misc{gamesofcountries-in-india-aadu-puli-aattam,
  title = {Goats and Tigers Game (India)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/in-india/aadu-puli-aattam}
}