After processing all terminal states and their ancestors, some states might remain unmarked. These are drawing states. Drawing states occur when there is a cycle where both players can avoid losing but neither can force a win.
Both players keep moving in the cycle. If the starting state is unmarked after the algorithm finishes, return draw. Otherwise, return the marked outcome. In the LeetCode Cat and Mouse problem, draw is represented by returning .