Graph game: cat starts at node 2, mouse at node 1. Mouse moves, then cat. Mouse wins by reaching node 0, cat wins by catching mouse.
State: . Outcomes: 1 = mouse wins, 2 = cat wins, 0 = draw (cycle). Transition: on mouse's turn, mouse picks a neighbor. On cat's turn, cat picks a neighbor (except 0). Determine outcome recursively. This is complex: we need to detect draws (cycles in the game graph). Use BFS/DFS with visited states.