After solving this problem, you understand how to model two-player games on graphs, handle cycles and draws, and use backward induction with BFS. This technique applies to many game problems. The steps are: identify the state space, find terminal states, and define transition rules.
Practice similar problems to solidify your understanding. Games on trees are simpler and good for building intuition.