Skip to main content
Formal Specification

Cat and Mouse (Circle Maze Tag) — Formal Specification

Slovakia · chase-tag · Confidence: low

← Back to game page

Implementation Suitability

Suitability: engine-readyFidelity: discretizedGap-fills: 4
# Na mačku a myš — AI-optimized specification ## General idea An asymmetric pursuit-evasion game on a topological wheel graph where a Cat agent attempts to navigate through dynamically switching gates to tag a Mouse agent, while a coalition of Guard agents synchronously toggles permeability between interior and exterior zones based on the passing entity's identity. ## Formal model - **Abstraction taken:** The playing area is modeled as a wheel graph consisting of a central interior node Vin, an exterior ring of nodes Vout,1…K, and K gate edges E1…EK connecting the exterior nodes to the interior node. Each gate k has state σk∈{OPEN,LOCKED}. The Mouse can traverse any gate regardless of state; the Cat can traverse gate k only if σk==OPEN. - **Player/agent count:** 1 Cat, 1 Mouse, K Guards (K∈[6,20]). - **Turn model:** Synchronous discrete ticks (tick length 0.5 s [gap-fill]). ## Formal rules R1. Setup: Mouse starts at Vin. Cat starts at an exterior node Vout,1. Each guard k∈{1…K} controls gate Ek. Default gate state is σk=OPEN [gap-fill]. R2. Synchronous Actions per Tick: - Mouse selects a move: vnext∈Neighbors(vMouse). - Cat selects a move: vnext∈Neighbors(vCat). - Each Guard k selects an action: ak∈{HOLD_OPEN,LOCK_GATE}. R3. Gate State Resolution: - If Guard k chooses LOCK_GATE, σk←LOCKED; otherwise σk←OPEN. R4. Movement Resolution: - Mouse moves to chosen neighbor unimpeded. - Cat moves to chosen neighbor: if traversing edge Ek and σk==LOCKED, the Cat's move fails and the Cat remains at its current node. R5. Tag Resolution: - If vCat==vMouse, the Mouse is captured; Cat wins the round immediately. R6. Energy / Time Limit: - Game runs for a maximum of Tmax⁡=60 ticks [gap-fill]. - If t=Tmax⁡ is reached without capture, the Mouse wins. ## Edge cases - Tie at the end condition: If tick reaches Tmax⁡ exactly as the Cat steps onto the Mouse's node, the tag takes precedence and Cat wins [gap-fill]. - A player with no legal move: Not applicable; all nodes have ≥2 neighbors and agents can choose to stay in place. - Repetition / cycles: Strictly bounded by the Tmax⁡=60 tick counter. - Simultaneous claims on the same resource or position: When Cat and Mouse occupy the same node, it triggers instant capture. - Player elimination mid-round; turn order repair: Capture ends the round immediately; no mid-round elimination. - Resource exhaustion (pieces, tokens, space, time): Ticks decrement monotonically from 60 to 0. - Termination guarantee: Deterministic maximum bound of Tmax⁡ ticks guarantees round conclusion. ## State representation - Persistent state: `tick: int (1..60)`, `cat_pos: NodeId`, `mouse_pos: NodeId`, `gate_states: dict[int, enum(OPEN, LOCKED)]`, `scores: dict[str, int]`. - Per-tick ephemeral state: `cat_intended_move: NodeId`, `mouse_intended_move: NodeId`, `guard_actions: dict[int, Action]`. - Observable information: Fully observable. All agents see all node positions and gate states. ## Action space - `cat_move(target_node: NodeId)`: Request traversal to an adjacent node. - `mouse_move(target_node: NodeId)`: Request traversal to an adjacent node. - `guard_set_gate(action: enum(HOLD_OPEN, LOCK_GATE))`: Set gate permeability. ## Playability notes - Single-player-vs-AI: Human as Cat solving a dynamic pathfinding puzzle with adversarial gatekeepers, or human as Mouse managing evasion timing. - Group games (n>4): Guard coalition can be played by individual heuristic agents or a single unified "Barrier AI" controlling all K gates. - Physical-skill games: Physical sprinting and arm-bracing strength are converted into graph navigation and gate state logic. - What is lost in the adaptation: Physical body contact, diving under arms, and verbal shouting of traditional chants. ## Implementation hints Low complexity. Graph navigation over a simple 1-center K-perimeter wheel network. First milestone: Implement graph traversal with static gate locks, then implement the Guard heuristic that locks Ek when Cat is on adjacent exterior nodes.

Download as JSON

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

Download JSON
Cite this page

Cat and Mouse (Circle Maze Tag) (Slovakia). (n.d.). Games of Countries. https://gamesofcountries.com/games/sk-slovakia/na-macku-a-mys

@misc{gamesofcountries-sk-slovakia-na-macku-a-mys,
  title = {Cat and Mouse (Circle Maze Tag) (Slovakia)},
  year = {n.d.},
  publisher = {Games of Countries},
  url = {https://gamesofcountries.com/games/sk-slovakia/na-macku-a-mys}
}