Skip to main content
Formal Specification

Cat and Mouse Circle Game — Formal Specification

North Macedonia · chase-tag · Confidence: low

← Back to game page

Implementation Suitability

Suitability: engine-readyFidelity: discretizedGap-fills: 4
# Мачка и глушец — AI-optimized specification ## General idea A discretized chase-and-tag game played on a 2D topological graph consisting of an Inner Zone, an Outer Perimeter Zone, and a circle of K gating nodes. The Mouse evades the Cat by transitioning through gates, which dynamically open to permit the Mouse while closing to impede the Cat. ## Formal model - **Abstraction taken:** The continuous circular ring is modeled as a circular graph of K=8 gate nodes g0…gK−1 connecting an Inner Center Zone Zin to an Outer Perimeter Ring Zout. Mouse movement through any gate gk costs 1 tick; Cat traversal through gate gk costs 1 tick if gate is open, or 3 ticks (obstacle delay) if gate is closed. - **Player/agent count:** 1 Cat (C), 1 Mouse (M), and K gate controller policies (or reduced 1v1 game where the gate environment automatically favors M). - **Turn model:** Tick-based sequential or simultaneous moves (M and C act each tick). ## Formal rules R1. **Graph Setup:** - Inner Center: Zin. - Outer Ring: Zout with 8 discrete positions {o0…o7}. - 8 Gates: g0…g7, each positioned between Zin and ok. - Gate states: State(gk)∈{Open,Closed} (initially all `Open` for M, `Closed` for C). R2. **Initial State:** M begins at Zin. C begins at outer position o0. Tick counter t=0, maximum ticks Tmax=50. R3. **Mouse Movement per Tick:** M submits action `move_mouse(target)`: - If at Zin: can move to any ok via gate gk (cost 1 tick). - If at ok: can move to adjacent o(k±1)(mod8) or enter Zin via gk (cost 1 tick). R4. **Cat Movement per Tick:** C submits action `move_cat(target)`: - If at ok: can move to adjacent o(k±1)(mod8) (cost 1 tick). - If attempting to enter Zin via gate gk: if gate is closed, traversal requires 3 ticks of continuous movement before entry is completed [gap-fill]. - If at Zin: can exit to ok with 2 ticks delay. R5. **Tag Condition:** If C and M occupy the same node (Zin or ok) at the conclusion of a tick, C successfully tags M. The Cat wins, scoring points proportional to (Tmax−t). R6. **Mouse Evasion Victory:** If t=Tmax=50 and C has not tagged M, the Mouse wins the round, scoring 50 points. R7. [gap-fill] Circle Gate Automation:** Gate gk automatically opens for M upon approach and closes against C unless C enters the exact gate within 1 tick of M's passage (following M's path). R8. [gap-fill] Velocity Cap:** Both agents move at base speed of 1 cell per tick along outer ring segments. ## Edge cases - Tie at the end condition: Not applicable; either C tags M at tick t≤50 (Cat win) or t reaches 50 without a tag (Mouse win). - A player with no legal move: `move` to an adjacent connected node or `wait()` is always legally available. - Repetition / cycles: Bounded by the hard termination condition at t=50. - Simultaneous claims on the same resource or position: Node co-occupancy triggers the tag capture event in R5. - Player elimination mid-round: Not applicable; 1v1 chase round. - Resource exhaustion: Graph topology is static and non-depletable. - Termination guarantee: [gap-fill] Guaranteed strictly by the t=50 upper tick bound. ## State representation - **Persistent state:** Match round count, cumulative scores (Scat,Smouse), player role assignments. - **Per-tick ephemeral state:** Mouse position posM∈{Zin,o0…o7}, Cat position posC, Cat traversal delay counter, tick t∈[0,50]. - **Observable information:** Fully observable; both agents observe exact locations and gate delay timers. ## Action space - `move_mouse(target_node)`: Valid connected target graph node. - `move_cat(target_node)`: Valid connected target graph node. ## Playability notes - Single-player-vs-AI: Highly playable as an asymmetric 1v1 pursuit-evasion game. - Group games (n>4): Reduces to 2 agents (M and C) with the K circle players modeled as the gate-switching environment. - Physical-skill games: Running speed differentials and ducking under held hands are modeled as traversal tick delays. - What is lost in the adaptation: The physical grip strength of children locking arms and the tactile struggle of wrestling through arm gates. ## Implementation hints Very low complexity. Graph with 1 center node and 8 perimeter nodes. First milestone: implement breadth-first search pursuit for Cat against random-walk Mouse and verify that tag and 50-tick victory triggers work correctly.

Download as JSON

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

Download JSON
Cite this page

Cat and Mouse Circle Game (North Macedonia). (n.d.). Games of Countries. https://gamesofcountries.com/games/mk-north-macedonia/machka-i-glushec

@misc{gamesofcountries-mk-north-macedonia-machka-i-glushec,
  title = {Cat and Mouse Circle Game (North Macedonia)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/mk-north-macedonia/machka-i-glushec}
}