The problem gives you a graph where the cat and mouse take turns moving. The state is (mouse position, cat position, whose turn). The mouse starts at vertex , the cat at vertex , and the food is at vertex .
The cat cannot move to vertex . You need to determine the outcome when both players play perfectly. This is a game on a product graph: the original graph crossed with itself. The state space has states times for whose turn it is.